搜索结果
找到约 1,024 项符合
Ctrl-F 的查询结果
数据结构 图论算法及其MATLAB 程序代码求赋权图G = ( V , E , F ) 中任意两点间
图论算法及其MATLAB 程序代码求赋权图G = ( V , E , F ) 中任意两点间
Java编程 NimROD L&F是一个具有多种主题的Swing皮肤
NimROD L&F是一个具有多种主题的Swing皮肤
数学计算 The jacobi.f program solves the Helmholtz equation on a regular mesh, using an iterative Jacobi meth
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
数学计算 The program md.f implements a simple molecular dynamics simulation in continuous real space. The vel
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 ...
游戏 F:RobinGameincludeinputRDXJoystick.rar DX8 游戏手柄完整类
F:\RobinGame\include\input\RDXJoystick.rar
DX8 游戏手柄完整类
数学计算 给出一组实验数据集(x,y),构造一条能较好反映这组数据所包含的规律的曲线F(x)
给出一组实验数据集(x,y),构造一条能较好反映这组数据所包含的规律的曲线F(x)
数据结构 Problem F:汽车加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language
Problem F:汽车加油
Time Limit:1000MS Memory Limit:65536K
Total Submit:1400 Accepted:404
Language: not limited
Description
一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法,指出应在哪些加油站停靠加油,使沿途加油次数最少。
编程任务:
对于给定的n和k(k <= 10000)个加油站位置, ...
数值算法/人工智能 This little Program allows you to send commands to the CardReader (CT-BCS) or to the Card itself. F
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 ...
数学计算 Hybrid Monte Carlo sampling.SAMPLES = HMC(F, X, OPTIONS, GRADF) uses a hybrid Monte Carlo algorithm
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.
数学计算 牛顿法的程序实现: 给的函数是f(x)=X*X-C 求导函数为ff() 也是在程序中已给定 若要修改则在程序中更改
牛顿法的程序实现:
给的函数是f(x)=X*X-C
求导函数为ff() 也是在程序中已给定 若要修改则在程序中更改