搜索结果
找到约 135 项符合
found 的查询结果
按分类筛选
- 全部分类
- 其他 (16)
- 人工智能/神经网络 (10)
- 书籍 (10)
- matlab例程 (9)
- Linux/Unix编程 (7)
- 文章/文档 (5)
- Java编程 (4)
- 数值算法/人工智能 (3)
- 数学计算 (3)
- 编译器/解释器 (3)
- VC书籍 (3)
- 其他书籍 (3)
- 汇编语言 (3)
- 游戏 (3)
- 软件设计/软件工程 (3)
- 单片机编程 (2)
- 无线通信 (2)
- 串口编程 (2)
- GPS编程 (2)
- 系统设计方案 (2)
- 微处理器开发 (2)
- 软件工程 (2)
- 单片机开发 (2)
- Delphi控件源码 (2)
- 压缩解压 (2)
- VHDL/FPGA/Verilog (2)
- 行业应用文档 (1)
- 多媒体处理 (1)
- 模拟电子 (1)
- 教程资料 (1)
- 可编程逻辑 (1)
- 源码/资料 (1)
- 生物技术 (1)
- Internet/网络编程 (1)
- 网络 (1)
- 嵌入式Linux (1)
- 书籍源码 (1)
- 技术管理 (1)
- Windows CE (1)
- Java书籍 (1)
- 数据结构 (1)
- 并行计算 (1)
- 其他数据库 (1)
- *行业应用 (1)
- 文件格式 (1)
- 行业发展研究 (1)
- Jsp/Servlet (1)
- 加密解密 (1)
- 能源行业(电力石油煤炭) (1)
- 嵌入式/单片机编程 (1)
- Delphi/CppBuilder (1)
- 认证考试资料 (1)
- 习题答案 (1)
- 技术资料 (1)
数值算法/人工智能 This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in seve
This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C++ derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. ...
人工智能/神经网络 This directory contains code implementing the K-means algorithm. Source codemay be found in KMEANS.C
This directory contains code implementing the K-means algorithm. Source codemay be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANSprogram accepts input consisting of vectors and calculates the givennumber of cluster centers using the K-means algorithm. Output isdirected to the screen ...
数学计算 亚定方程组求解:If serial correlation is found, you may have misspecified your model and should return to y
亚定方程组求解:If serial correlation is found, you may have misspecified your model and
should return to your theory for a better representation of the data generating
process. This possibility is quite likely and should be taken seriously.
微处理器开发 Programmed for Atmel STK-500 development board, detalis can be found at http://www.cs.hut.fi/Studies
Programmed for Atmel STK-500 development board, detalis can be found at http://www.cs.hut.fi/Studies/T-106.5300/2007/stk500.html
人工智能/神经网络 This code in this directory implements the binary hopfield network. Source code may be found in HOP
This code in this directory implements the binary hopfield network.
Source code may be found in HOPNET.CPP. A sample training file is
H7x8N4.trn. Sample test pattern files are: H7x8D4.TST, H5x8D7.TST,
H5x8D7.TST and H5x8D9.TST, Output of the program goes to both the
screen and a file, ARCHIVE.LST. ...
书籍源码 Did anyone ask for an integer version of sqrt? Following is an implementation I found and adapted.
Did anyone ask for an integer version of sqrt? Following is an implementation I
found and adapted. Hope it is useful for somebody.
Java书籍 To date tests are still the best solution mankind has found to deliver working software. This book
To date tests are still the best solution mankind has found to deliver working software.
This book is the sum of four years of research and practice in the testing
field. The practice comes from my IT consulting background, first at Octo Technology
and then at Pivolis the research comes from my invo ...
人工智能/神经网络 This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS
This directory contains code implementing the K-means algorithm. Source code
may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS
program accepts input consisting of vectors and calculates the given
number of cluster centers using the K-means algorithm. Output is
directed to the sc ...
Java编程 An object based tree widget, emulating the one found in microsoft windows, | | with persistence usi
An object based tree widget, emulating the one found in microsoft windows, |
| with persistence using cookies. Works in IE 5+, Mozilla and konqueror 3.
数值算法/人工智能 The last step in training phase is refinement of the clusters found above. Although DynamicClusteri
The last step in training phase is refinement of the clusters
found above. Although DynamicClustering counters all the
basic k-means disadvantages, setting the intra-cluster similarity
r may require experimentation. Also, a cluster may
have a lot in common with another, i.e., sequences assigned
to i ...