遺傳算法解決TSP問題 已知n個城市之間的相互距離，現有一個推銷員必須遍訪這n個城市，并且每個城市只能訪問一次，最后又必須返回出發城市。如何安排他對這些城市的訪問次序，可使其旅行路線的總長度最短？
上傳時間： 2013-12-26
上傳用戶：trepb001
％The phase locked loop(PLL),adjusts the phase of a local oscillator ％w.r.t the incoming modulated signal.In this way,the phase of the ％incoming signal is locked and the signal is demodulated.This scheme ％is used in PM and FM as well. ％We will implement it by using a closed loop system.Control systems ％techniques are applied here.
標簽： phase w.r.t oscillator modulated
上傳時間： 2015-09-28
上傳用戶：zhangzhenyu
產生N=100個在（0,50）區間內滿足對數正態分布的隨機數
上傳時間： 2014-01-01
上傳用戶：sjyy1001
產生N=100個在（0,50）區間內滿足瑞利分布的隨機數
上傳時間： 2014-01-06
上傳用戶：han_zh
widows認證w idows認證w idows認證w idows認證w idows認證w idows認證
上傳時間： 2014-01-03
上傳用戶：gtf1207
v n vb
標簽： vb
上傳時間： 2015-10-01
上傳用戶：as275944189
生成Bipartite Graphs ./distributions -u -m 1 -M 10 -n 100 -s 500 > top_distrib ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 > bottom_distrib ./random_bipartite -t top_distrib -b bottom_distrib > bn_test
標簽： distributions top_distrib Bipartite Graphs
上傳時間： 2015-10-02
上傳用戶：yy541071797
Brian W. Kernighan和Dennis M. Ritchie.寫的權威C語言書籍。
上傳時間： 2015-10-04
上傳用戶：lht618
American Gladiator,You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants in order of strength this is done via a series of 1-on-1 matches between contestants and gladiators. If the contestant is stronger than the gladiator, then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength, then they are “perfect equals” and a tie is declared. We assume that each contestant is the perfect equal of exactly one gladiator, and each gladiator is the perfect equal of exactly one contestant. However, as the gladiators sometimes change from one show to another, we do not know the ordering of strength among the gladiators.
標簽： contestants consulting Gladiator are
上傳時間： 2013-12-18
上傳用戶：windwolf2000
Preparation of a function, even to the importation of n, the function call seeking +1/n 1/2+1/4+ .... When n is odd input, the function call 1/1+1/3+ ... +1/n (using function pointer)
標簽： function Preparation importation the
上傳時間： 2014-01-21
上傳用戶：semi1981
