Welcome![Sign In][Sign Up]
Location:
Search - modified greedy algorithm

Search list

[Communication-MobileOFDM-MATLAB

Description: 可以运行的m4k20功率分配图,mimo功率优化,OFDM典型仿真程序,贪婪算法仿真程序,以及16QAM仿真程序,经过修改的可以使用-M4k20 can run the power distribution map, mimo power optimization, OFDM typical simulation program, greedy algorithm simulation program, as well as 16QAM simulation procedures can be modified to use
Platform: | Size: 2253824 | Author: 于晓明 | Hits:

[Data structsbit_power_allocation

Description: :该文研究OFDM 系统在总功率和误比特率限定下最大化传输速率的问题,并且考虑实际系统中整数比特的限制, 提出基于灌水法则的两种比特分配算法——改进贪婪算法和对分灌水线搜索法-The maximization of data rate under the constraint of total transmit power and bit error rate is a considerable issue in OFDM system. Recognizing that the number of bits on each subcarrier must be a discrete number for real systems, this paper proposed two bit allocation algorithm which are modified greedy algorithm and water filling level binary searching algorithm.
Platform: | Size: 263168 | Author: hodog | Hits:

[Software EngineeringB01AB525d01

Description: The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this paper, we address the problem of generalizing LC tries and Extensible Hashing, based on traces of past lookups, to provide performance guarantees for memory sub-optimal structures. As a specific example, if a memory-optimal (LC) trie takes 6MB and the total memory at the router is 8MB, how should the trie be modified to make best use of the 2 MB of excess memory? We present a greedy algorithm for this problem and prove that, if for the optimal data structure there are b fewer memory accesses
Platform: | Size: 147456 | Author: asad2001 | Hits:

[AI-NN-PRtsp

Description: 简单的贪心算法解决tsp问题。输入的时候麻烦点,读者可以加以修改,使程序完善。-Tsp simple greedy algorithm to solve the problem. When the input trouble spots, readers can be modified to process improvement.
Platform: | Size: 1006592 | Author: liulunchun | Hits:

CodeBus www.codebus.net