<sup id="06iue"></sup>
The Ralink 802.11n Chipset family provides solutions for PCI, PCIe and USB interfaces with both 2.4 and 2.4/5GHz suppport. Each chipset consists of two highly integrated ICs (RFIC and BB/MAC IC) that fully comply with current draft IEEE 802.11n and IEEE 802.11a/b/g standards.
標(biāo)簽： interfaces solutions provides Chipset
上傳時間： 2014-01-13
上傳用戶：Thuan
Program by matlab. For instance, solve math problem and matrix analize.
標(biāo)簽： instance Program analize problem
上傳時間： 2014-12-08
上傳用戶：ANRAN
用Kruskal算法構(gòu)造最小生成樹解決指派問題（assignment problem） 一家公司經(jīng)理準(zhǔn)備安排 名員工去完成 項任務(wù)，每人一項。由于各員工的特點不同，不同的員工去完成同一項任務(wù)時所獲得的回報是不同的。如何分配工作方案可以使總回報最大？
標(biāo)簽： assignment Kruskal problem 算法
上傳時間： 2016-09-24
上傳用戶：hoperingcong
it use the genetic algorithm to deal with the TSP problem
標(biāo)簽： algorithm the genetic problem
上傳時間： 2016-10-14
上傳用戶：zhangliming420
％ PURPOSE : Demonstrate the differences between the following filters on the same problem: ％ ％ 1) Extended Kalman Filter (EKF) ％ 2) Unscented Kalman Filter (UKF) ％ 3) Particle Filter (PF) ％ 4) PF with EKF proposal (PFEKF) ％ 5) PF with UKF proposal (PFUKF)
標(biāo)簽： the Demonstrate differences following
上傳時間： 2016-10-20
上傳用戶：wuyuying
VHDL hand book for technical engineer or student for reference.
標(biāo)簽： for technical reference engineer
上傳時間： 2016-10-23
上傳用戶：chens000
此代碼描述了一個簡單的student類，添加了一些屬性如姓名學(xué)號等
上傳時間： 2016-10-23
上傳用戶：sz_hjbf
Pattern Recognition and Machine Learning Solutions to the Exercises，模式識別與機器學(xué)習(xí)的答案
標(biāo)簽： Recognition Exercises Solutions Learning
上傳時間： 2014-01-13
上傳用戶：417313137
For solving the following problem: "There is No Free Lunch" Time Limit: 1 Second Memory Limit: 32768 KB One day, CYJJ found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of "Lunch Special" which was said that one could "buy one get two for free". That is, if you buy one of the dishes on their menu, denoted by di with price pi , you may get the two neighboring dishes di-1 and di+1 for free! If you pick up d1, then you may get d2 and the last one dn for free, and if you choose the last one dn, you may get dn-1 and d1 for free. However, after investigation CYJJ realized that there was no free lunch at all. The price pi of the i-th dish was actually calculated by adding up twice the cost ci of the dish and half of the costs of the two "free" dishes. Now given all the prices on the menu, you are asked to help CYJJ find the cost of each of the dishes.
標(biāo)簽： Limit following solving problem
上傳時間： 2014-01-12
上傳用戶：362279997
student manage system
標(biāo)簽： student manage system
上傳時間： 2013-12-05
上傳用戶：mikesering
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
