搜索结果

找到约 1,697 项符合 V-F 的查询结果

数学计算 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 ...
https://www.eeworm.com/dl/641/279379.html
下载: 118
查看: 1036

数据结构 多模式匹配算法——AC算法 参考文献:AC算法:Aho A V

多模式匹配算法——AC算法 参考文献:AC算法:Aho A V,Corasick M J.Efficient string matching:an aid to bibliographic search.Communications of ACM,1975,18(6):333~340
https://www.eeworm.com/dl/654/280238.html
下载: 135
查看: 1060

游戏 F:RobinGameincludeinputRDXJoystick.rar DX8 游戏手柄完整类

F:\RobinGame\include\input\RDXJoystick.rar DX8 游戏手柄完整类
https://www.eeworm.com/dl/625/281472.html
下载: 66
查看: 1030

数学计算 给出一组实验数据集(x,y),构造一条能较好反映这组数据所包含的规律的曲线F(x)

给出一组实验数据集(x,y),构造一条能较好反映这组数据所包含的规律的曲线F(x)
https://www.eeworm.com/dl/641/282787.html
下载: 99
查看: 1028

数据结构 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)个加油站位置, ...
https://www.eeworm.com/dl/654/282898.html
下载: 192
查看: 1075

通讯编程文档 V-LAN 虚拟局域网的学习笔记

V-LAN 虚拟局域网的学习笔记,总结性很强,对一些常见问题都有解答,学习性很强
https://www.eeworm.com/dl/646/284085.html
下载: 184
查看: 1031

电子书籍 ITU V.8 规范,高速传真协议握手时需要用到.

ITU V.8 规范,高速传真协议握手时需要用到.
https://www.eeworm.com/dl/cadence/ebook/286042.html
下载: 74
查看: 1017

软件设计/软件工程 JavaTM 2 Platform, Enterprise Edition, v 1.3 API Specification

JavaTM 2 Platform, Enterprise Edition, v 1.3 API Specification
https://www.eeworm.com/dl/684/287346.html
下载: 151
查看: 1069

系统设计方案 crw-v用户手册

crw-v用户手册,这个主要是一个读卡器的使用方式,即它的函数调用
https://www.eeworm.com/dl/678/287881.html
下载: 109
查看: 1015

数学计算 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.
https://www.eeworm.com/dl/641/289151.html
下载: 138
查看: 1190