图论算法及其MATLAB 程序代码求赋权图G = ( V , E , F ) 中任意两点间
上传时间： 2013-12-11
上传用户：ommshaggar
NimROD L&F是一个具有多种主题的Swing皮肤
上传时间： 2013-12-03
上传用户：onewq
The jacobi.f program solves the Helmholtz equation on a regular mesh, using an iterative Jacobi method with over-relaxation. Parallelism is exploited in both the solver and the numerical error checking
标签： Helmholtz iterative equation program
上传时间： 2016-04-03
上传用户：杜莹12345
The program md.f implements a simple molecular dynamics simulation in continuous real space. The velocity Verlet algorithm is used to implement the time stepping. The force and energy computations are performed in parallel, as is the time integration. (The program uses some Fortran90 features, so an F90 compiler may be needed.)
标签： implements continuous simulation The
上传时间： 2016-04-03
上传用户：zhaiye
F:\RobinGame\include\input\RDXJoystick.rar DX8 游戏手柄完整类
标签： RobinGameincludeinputRDXJoystick DX8 手柄
上传时间： 2013-11-27
上传用户：songnanhua
给出一组实验数据集（x,y),构造一条能较好反映这组数据所包含的规律的曲线F(x)
上传时间： 2014-01-11
上传用户：1051290259
Problem F:汽车加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Description 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。 编程任务： 对于给定的n和k(k <= 10000)个加油站位置，编程计算最少加油次数。 Input 第一行有2 个正整数n和k，表示汽车加满油后可行驶n公里，且旅途中有k个加油站。接下来的1 行中，有k+1 个整数，表示第k个加油站与第 k-1 个加油站之间的距离。第0 个加油站表示出发地，汽车已加满油。第k+1 个加油站表示目的地。 Output 输出最少加油次数。如果无法到达目的地，则输出”No Solution”。 Sample Input 7 7 1 2 3 4 5 1 6 6 Sample Output 4
标签： Limit Accepted Language Problem
上传时间： 2016-04-12
上传用户：youth25
This little Program allows you to send commands to the CardReader (CT-BCS) or to the Card itself. First you will be ask to what Port the Reader is connected (0=COM1, 1=COM2). Then the Class-Byte (CLA), Instruction-Byte (INS), Parameter 1 (P1), Parameter 2 (P2). If wou don愒 want to send Parameter 3 (P3) press Ctrl-d (^d). If you enter a number then you have to the Bytes of the Datafield. After the last Byte of the Datafield is entered the whole APDU is send the replay is displayed. After that you can send the next APDU.
标签： CardReader the commands to
上传时间： 2016-04-23
上传用户：nanxia
Hybrid Monte Carlo sampling.SAMPLES = HMC(F, X, OPTIONS, GRADF) uses a hybrid Monte Carlo algorithm to sample from the distribution P ~ EXP(-F), where F is the first argument to HMC. The Markov chain starts at the point X, and the function GRADF is the gradient of the `energy function F.
标签： Carlo Monte algorithm sampling
上传时间： 2013-12-02
上传用户：jkhjkh1982
牛顿法的程序实现: 给的函数是f(x)=X*X-C 求导函数为ff() 也是在程序中已给定 若要修改则在程序中更改
上传时间： 2014-02-09
上传用户：xinzhch
