N－way分析工具箱，有許多malab程序可用
上傳時(shí)間： 2015-09-24
上傳用戶：gundan
程序最優(yōu)存儲(chǔ)問題 « 問題描述： 設(shè)有n 個(gè)程序{1,2,…, n }要存放在長(zhǎng)度為L(zhǎng)的磁帶上。程序i存放在磁帶上的長(zhǎng)度是i l ，
標(biāo)簽： laquo 程序 磁帶 長(zhǎng)度
上傳時(shí)間： 2015-09-26
上傳用戶：xg262122
寫入N字節(jié)數(shù)據(jù)程序 把N個(gè)字節(jié)數(shù)據(jù)寫入起始地址為ADDR的EEPROM內(nèi)
標(biāo)簽： EEPROM ADDR 字節(jié) 數(shù)據(jù)
上傳時(shí)間： 2013-12-29
上傳用戶：zhanditian
遺傳算法解決TSP問題 已知n個(gè)城市之間的相互距離，現(xiàn)有一個(gè)推銷員必須遍訪這n個(gè)城市，并且每個(gè)城市只能訪問一次，最后又必須返回出發(fā)城市。如何安排他對(duì)這些城市的訪問次序，可使其旅行路線的總長(zhǎng)度最短？
上傳時(shí)間： 2013-12-26
上傳用戶：trepb001
產(chǎn)生N=100個(gè)在（0,50）區(qū)間內(nèi)滿足對(duì)數(shù)正態(tài)分布的隨機(jī)數(shù)
標(biāo)簽： 100 50 對(duì)數(shù) 分布
上傳時(shí)間： 2014-01-01
上傳用戶：sjyy1001
產(chǎn)生N=100個(gè)在（0,50）區(qū)間內(nèi)滿足瑞利分布的隨機(jī)數(shù)
標(biāo)簽： 100 50 分布 隨機(jī)數(shù)
上傳時(shí)間： 2014-01-06
上傳用戶：han_zh
v n vb
標(biāo)簽： vb
上傳時(shí)間： 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
標(biāo)簽： distributions top_distrib Bipartite Graphs
上傳時(shí)間： 2015-10-02
上傳用戶：yy541071797
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.
標(biāo)簽： contestants consulting Gladiator are
上傳時(shí)間： 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)
標(biāo)簽： function Preparation importation the
上傳時(shí)間： 2014-01-21
上傳用戶：semi1981
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
