搜索资源列表
精通MATLAB(word
- 精通MATLAB这本书的word般，该版只能用于学习，不能做为商业用途-Be well up in the word of book of MATLAB ,It s only for studying,cann t be for the business.
ACATSP
- It s a word document,matlab code,basic algorithm of ant colony.-It's a word document, Matlab code, basic algorithm of ant colony.
23952
- My (so called) HiP compression algorithm as console mode utility. It s a hybrid of Lempel-Ziv 77 and Adaptive Huffman encoding (Huffman + LZ77 ZIP = HiP) with a word prefix hash algorithm etc.-My (so called) a compression algorithm HiP '
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
artificial_intelligence_demo_programs
- 光盘中的演示实例是人工智能原理和方法的演示程序.包括基于归结原理的推理系统,合一算法,等式归结,归类算法,野人与传教士过河问题,八数码问题,八皇后问题,一字棋,博弈算法,遗传算法和蚁群算法等的演示。-CD-ROM presentation of a number of examples of the hard work of graduate and undergraduate results. Including reasoning based on the principle of the
artificial_intelligence_demo_programs
- 光盘中的演示实例是人工智能原理和方法的演示程序.包括基于归结原理的推理系统,合一算法,等式归结,归类算法,八数码问题,八皇后问题,一字棋,博弈算法,遗传算法和蚁群算法等的演示。-CD-ROM presentation of examples of the principles and methods of artificial intelligence demo program. Including reasoning based on the principle of the system c
sas
- 本文提出了商业公司的订货问题，包括货物从工厂到仓库，再到分店销售两部分，是经济管理中的优化问题。根据改进的综合了贮存与运输的模型，我们建立了非线性整数规划模型进行求解，得出初步的优化订货及运输方案，并在问题2和问题3中增加了一些实际考虑因素，将问题拓展。-In this paper, the company' s orders for commercial issues, including goods from the factory to the warehouse, to sales
SVM_go
- 支持向量机SVM入门学习资料，是word版的，学习SVM的同志一定要看！-Introduction to support vector machine SVM learning materials is a version of the word to learn SVM' s comrades must see!
he_fu_man_bian_ma
- 假设一个文件中出现了8种符号S0，SQ，S2，S3，S4，S5，S6，S7，那么每种符号要编码，至少需要3bit。假设编码成000，001， 010，011，100，101，110，111。那么符号序列S0S1S7S0S1S6S2S2S3S4S5S0S0S1编码后变成 000001111000001110010010011100101000000001，共用了42bit。我们发现S0，S1，S2这3个符号出现的频率比较大，其它符号出现的频率比较小，我们采用这样的编码方案：S0到S7的码辽分别01
Gauss_Seidel
- this a program written by fortran for solving Gauss_Seidel. it s in word file.-this is a program written by fortran for solving Gauss_Seidel. it s in word file.
YH_zhizhu_1.0
- 军长搜索是一款基于 Microsoft .NET 2.0 开发的垂直搜索引擎。系统有着强大的文件和数据库引索能力，支持中英文分词，文件相似度分析排序，文件数据时实监控与更新，恐龙级的引索速度和毫秒级的搜索速度，搜索结果高亮显示，系统分两部分组成第一部分是Ｃ/s的搜索蜘蛛，第二部分是Ｂ/s的 ＷＥＢ用户搜索显示界面，其整个系统的工作过程完全模仿了超级搜索引擎的工作原理。系统支持对站内和全网的引索。 产品适用范围： 行业垂直搜索引擎、大型新闻门户网站站内搜索、大型行业门户网站
Stewart-91
- Tiny Voice—is based on a low-cost, 20-pin single-chip controller. It’s a speaker-dependent, templatebased, isolated-word recognizer. You train it to recognize your voice.
AGC
- 用MATLAB实现AGC，并且还有Word的文字说明，已经在MATLAB上实现过了。-MATLAB implementation by AGC, and there are Word' s text has been realized in MATLAB before.
sufa
- Algorithm(算法)一词本身就十分有趣。初看起来，这个词好像是某人打算要写 “Logarithm”(对数)一词但却把头四个字母写的前后颠倒了。这个词一直到1957年之前在Webster s New World Dictionary(《韦氏新世界词典》)中还未出现，我们只能找到带有它的古代涵义的较老形式的“Algorism”(算术)，指的是用阿拉伯数字进行算术运算的过程。在中世纪时，珠算家用算盘进行计算，而算术家用算术进行计算。中世纪之后，对这个词的起源已经拿不准了，早期的语言学家试图推断它
hangman
- This file performs the famous game of HANGMAN. The rules of the Game are:There is an unknown Word whose characters are displayed as * s in front of You in the Figure Window You have nine trials to know that Word You just type a letter and pr
change
- 这是一套实现字典顺序查找的c++容器编写的算法，对于不重复的大型文档速度很优越，已经在codeblocks下成功运行。代码最大的特点是效率非常好-it s good for someone who want find a word in a long file.you can find that c++ vector is very fast and simple.
wordreportdemo
- 本程序的功能是将模型生成到word中的演示-The program s function is to generate a model to demonstrate in word
POSION
- 基于matlab的有限元法求解泊松方程，WORD的形式，里面附有源程序-Matlab-based finite element method for solving Poisson s equation
automatic-word-segmentation
- 实现一个中文自动分词程序，所使用的编程语言不限 选作：对人名，地名，机构名的识别 下载北大计算语言所标注的99年人民日报分词语料库，构建一个词表 实现正向、逆向最大分词算法-To implement a Chinese automatic word segmentation procedure, used by any programming language Chosen for: the person names, place names, organization name
Word-Ladder
- 给定两个词(beginWord和endWord)和字典的单词列表,找到所有最短转换序列(s)beginWord endWord,这样: 一次只能改变一个字母；每个中间必须存在于词列表-Given two words (beginWord and endWord), and a dictionary s word list, find all shortest transformation sequence(s) beginWord to endWord, such that: Onl