搜索资源列表
free3of9
- Barcode font, 3-9, Fr-Barcode font, 3-9, Free
2
- FR共轭梯度法求非线性无约束最优化(函数极值)问题-FR conjugate gradient method for solving nonlinear unconstrained optimization (function extremum) problem
mm
- 自己实现malloc,realloc,fr-write your own function of malloc,realloc,free
oscam-master
- Enthä lt relativ alte Sourcen der MGCam für DVB-S. Die neuesten enthaltenen Dateien sind vom 31.8.2003.
CG
- 共轭梯度法求解线性方程组,主要采用FR共轭梯度法-solve liner solutions from CG
MSP-EXP430FR5739-User-Experience
- MSP430 Example program series FR board
123
- CAD实现批量查找替换,简单方便( FR 源文本 目标文本 文件名) 利用ObjectDBX技术不打开DWG文件替换文本- ( FR 源文本 目标文本 文件名) 利用ObjectDBX技术不打开DWG文件替换文本
bs-binary-admin
- bootstrap example, como usar bootstrap, template fr-bootstrap example, como usar bootstrap, template free
Wapiti-master
- python-wapiti is a python wrapper for wapiti (http://wapiti.limsi.fr), a very nice sequence labeling tool with support for maxent models, maximum entropy Markov models and linear-chain CRF.
frcg
- FR共轭梯度法求解无约束优化问题,其中一维搜索用Armijo搜索。-Fletcher-Reeves method for optimization
phpoll_src
- Online Poll System Free Online Poll System Free Online Poll System Fr-Online Poll System Free Online Poll System Free Online Poll System Free Online Poll System Free
FR
- 共轭梯度法,一种适合于研究生最优化方法课程的小程序,基于matlab的一个算例仿真-Conjugate gradient method, which is suitable for most graduate programs applet optimization, simulation based on a study of matlab
FRViewXMLData
- fr report view data xml file-fr report view data xml file
Becker_Skin_Wechsel
- Becker_Skin_Wechsel, skinwechsen für becker navigationssoftware.
igo8blau-Z99-Z103
- skin für becker Z103 navigationsgerä t
NOTEPAD
- notepad für wince navigationsgerä te
blindsourceseparation
- fr,jdjbvl/jj nkc bl/c jkvb sdohnxck b lk -fr,jdjbvl/jj nkc bl/c jkvb sdohnxck b lk
MASM
- Java版的企业人事管理系统完整版源码,采用Oracle数据库,运行于Eclipse,压缩包内附有配置文档和系统说明。这套系统可完成档案管理、人事管理、考勤管理、工资管理、用户管理、财务报表等功能。界面漂亮友好,是学习的第一手资料。(djs sdfle edf se esl 3ilsfe 3ewlsau aw asw ra fr)
win-3.11-fr
- Windows 3.11 install
gongetidu
- 用于解决非线性无约束优化问题(It is used to solve nonlinear unconstrained optimization problem)