搜索资源列表
number.rar
- 求1000以内的水仙花数
dossier
- For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics
FEX
- 用java做的平面珩架结构有限元分析软件。 基本性能如下：结点数<500,单元数<1000，（具体情况视内存大小而定）在一般的微机 上，算一百节点以下的结构，基本上不用等待。-do with the plane Heng Structure finite element analysis software. The basic properties as follows : nodes lt; 500, Number of units lt; 1000, (depending
Volterra_luzhenbo5
- 更新说明： 此版本在版本1、2的基础上做了2点重大改进 1、改进了PhaSpa2VoltCoef函数算法，使得现算法的运行速度约是原算法的4倍 2、改进了volterra_train_lu函数算法，使得相对均方误差提高了约1000倍，新算法不再需要对样本做归一化处理-Update : This version of the 1,2 version on the basis of a 2:00 a significant improvement, improved PhaSpa2Vol
accepted1
- 解决时钟问题，acm竞赛题 A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind.
accept
- 数字运算，判断一个数是否接近素数 A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in
clarke
- 这里有2组图，“1000.0.05”这一组是运行结果比较好的一组图，但是当时修改了时间间隔而没有改坐标说明，所以db1000.0.05.fig这幅图的坐标说明后来做了人工改正（应该是“time(0～250ms分成5000组,步长0.05ms”）。-Reuters, "1000.0.05" This group is running a relatively good results Reuters. But then amended the time interval and
gafmax
- ％ [BestPop,Trace]=fmaxga(FUN,LB,UB,eranum,popsize,pcross,pmutation) ％ Finds a maximum of a function of several variables. ％ fmaxga solves problems of the form: ％ max F(X) subject to: LB <= X <= UB ％ BestPop--------最优的群体即为最优的染色体群 ％
ss54355454
- 求1000万以内的素数。-for 10 million within the prime.
Fast_Dijkstra
- 时间复杂度为O(ElogV)的Dijkrastra算法的实现，解决城市道路网的最短路径问题，可以计算1000×1000个节点。
SPIHT_matlab_code
- MATLAB implementation of SPIHT (without Arithmatic coding stage). ％ Performance evaluation : this toolbox VS. SPIHT ％ Test image: lena512.raw ％ bpp SPIHT(dB) This code(dB) ％ 0.1000 29.8107 29.3202 ％ 0.2000 32.7202 32.2514 ％ 0.3000 34.5
MAOS_TSP
- 用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation of basic run.bat see, see the
psb2machines_pss
- 一1000 MW水电站（机组M1）通过一条500 kV, 700 km的输电线路与负载中心连接。负载中心模型是5000 MW的阻抗负载，由遥远的1000 MW电站和当地的5000 MW (机组 M2)电站供电。系统已经初始化，因此线路传送950 MW，接近它的潮流阻抗负载（SIL = 977 MW）。这两台机相当于一台水轮机和管理(HTG)，励磁系统和电力系统稳定器(PSS)。这三个模块位于“涡轮和调速”子系统中。通过此例，在500 kV系统中制造故障，观察PSS对系统稳定性的影响。-a 1,0
LowestBit
- Given an positive integer A (1 <= A <= 109), output the lowest bit of A. For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2. Another example goes like this: given A = 88, w
yyys
- 用AMBE－1000语音压缩芯片来做窄带无线语音传输的源码-no
POJ1000-1010
- ACM 相关的，POJ 1000-1010的全部解答，程序十分完备 部分还有文字说明-ACM-related, POJ 1000-1010 all the answers, procedures, and there is still a very complete text descr iption
NK12---1000
- 针对NK模型的仿真，有1000次迭代的情况，很有参考价值-For NK model simulation, there are 1000 iterations situation of great reference value
1000-2618(2013)05-0469-06
- 时变离散时空系统的混沌性1000-2618(2013)05-0469-06-Chaos of time-varying discrete spatiotemporal systems
1000-2618(2013)05-0475-05
- 利用混合巡游方法控制时空混沌1000-2618(2013)05-0475-05-Control of spatiotemporal chaos by a hybrid itinerant feedback method
sum-1-to-1000
- 1连加至1000的mpi程序，可调节线程，适合Mpi初学者-the program if about sum 1 to 1000, you can choose process for yourself, suit for mpi learner