N－way分析工具箱，有许多malab程序可用
上传时间： 2015-09-24
上传用户：gundan
程序最优存储问题 « 问题描述： 设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是i l ，
上传时间： 2015-09-26
上传用户：xg262122
写入N字节数据程序 把N个字节数据写入起始地址为ADDR的EEPROM内
上传时间： 2013-12-29
上传用户：zhanditian
遗传算法解决TSP问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？
上传时间： 2013-12-26
上传用户：trepb001
产生N=100个在（0,50）区间内满足对数正态分布的随机数
上传时间： 2014-01-01
上传用户：sjyy1001
产生N=100个在（0,50）区间内满足瑞利分布的随机数
上传时间： 2014-01-06
上传用户：han_zh
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
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
