搜索资源列表
hanoie
- 很好的一个汉诺塔问题的解法,方法非常灵活有效-good HANOR a solution to the problem, the method is very flexible and effective
hnt
- 汉诺塔问题的另一种解法,方法非常灵活有效,运行效率高-HANOR of another solution, a very flexible and effective method, high efficiency operation
bpjd
- 直接的源代码形式,没有解压密码,即解即用,也可能有点语法问题,请使用的时候注意一下-direct source code form, without extracting passwords, that solution is used, may be a bit syntax, please use the time to take note
java_example
- 实例(java) 1. 编写一个程序,列出1 到1000 以内的,求59 的余后为1 质数。 2. 试编写程序解下面的问题。猴子吃桃问题:猴子第一天摘下若干个桃子,当即吃了 一半,还不瘾,又多吃了一个 第二天早上又将剩下的桃子吃掉一半,又多吃了一个。 以后每天早上都吃了前一天剩下的一半零一个。到第10 天早上想再吃时,见只剩 下一个桃子了。求第一天共摘了多少。 3. 编写一个程序求1+2!+3!+...+20!的和。 4. 试编写程序求解下面的问题:海滩上有一堆桃子,
1_58.33.230.90__2005_10_31_14_39_50_
- vc++贪心解装箱.cpp dddvc++贪心解装箱.cpp -vc greedy solution crates. Cpp dddvc greedy solution crates. Cpp
FJS
- 按作业效益非增序输入作业的截止期限,要求使用上述规则设计出一个算法,使得输出为一个作业可行集j[]。即如果作业i可以在截止期限前执行完毕则将其加入j[]。这样得出的一个结果是最优解,可以获得最大的效益值。-operating efficiency by increasing non-operating input sequence that the deadline for requests to use these rules to design a lgorithm, the output
Neville
- 本程序为基于matlab的插值分析与Euler解常微分方程的应用实例。-the procedures for the Matlab-based analysis and interpolation Euler solution of the ordinary differential equations application examples.
camera_cad
- 用CANDENCE软件设计的130万数码相机的解决方案。-CANDENCE software design with the 1.3 million digital cameras solution.
solveequation
- 这是一个解方程的原代码,直接调用,很方便。-This is a solution of the original equation code called directly, very convenient.
Expert_Choice[1]
- Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the exp
8queensProblem
- 搜索8皇后问题的第一个解。使用了两种方法:1.普通的回朔法搜索。 2.修改后的搜索(先搜索most contrainted变量的方法) 使用vc++.net 2003开发 -search of a solution. The use of two methods : 1. General Re search Schomburg law. 2. After the revised search (first search contrainted most variable method)
h.263ENCODE&DECODE
- H.263的编解码的代码实现 H.263的编解码的代码实现-H.263 codec code to achieve H.263 codec H.263 source implementation of the Part Solution the source code to achieve
Viterbi-decoding
- 通信系统的仿真,Viterbi译码可用于卷积码等的译码解决方案,可以用于通信领域,本例子给出了基于matlab的程序,可用于实际的仿真!-communications system simulation, Viterbi decoder can be used as a convolutional code decoding solution, communications can be used, the example is given of the procedures based on
GA-1
- 一个利用遗传算法求解最优解的程序 主要是利用遗传算法迭代寻求最优的逼近解-using a genetic algorithm for optimal solution of the main procedures is the use of genetic algorithms for optimal iterative approximation Solutions
GA-2
- 利用遗传算法求解一个问题的最优解,包括交叉、变异等过程 -using a genetic algorithm for the optimal solution, including crossover and mutation processes
CONAX
- CONAXCA的源代码,怎么设置过滤器,怎么解EMM,ECM都有-CONAXCA the source code, how set up filters, how EMM solution, ECM has.
sjwllw
- 初步研究神经网络模型的构造方法,并利用多输入单输出切比雪夫神经网络模型建立世界干散海运量各年的海运量预测模型解决具体问题-preliminary study of the neural network model construction method, and the use of multiple-input single-output Chebyshev neural network model of the world's seaborne dry bulk quantities
Galerkin--Euler
- 程序是用for写的,没有这一项 主要是求解欧拉方程-procedure is used for writing, no such solution is a major Euler Equations
thomp
- 网格计算程序,求解La氏方程,生成二维网格-grid, La Solution's equation, generating two-dimensional grid
htf1d
- 一维粘性流体求解,显示格式,欧拉时间离散-one-dimensional viscous fluid solution, display format, the Euler discrete time