搜索结果
找到约 325 项符合
FinD 的查询结果
按分类筛选
- 全部分类
- 其他 (31)
- matlab例程 (27)
- 书籍 (19)
- 其他书籍 (17)
- 数学计算 (12)
- Linux/Unix编程 (12)
- 数值算法/人工智能 (11)
- Java编程 (11)
- 数据结构 (8)
- 电子书籍 (8)
- Delphi控件源码 (7)
- 编译器/解释器 (7)
- VHDL/FPGA/Verilog (7)
- VC书籍 (7)
- 通讯/手机编程 (6)
- 软件工程 (6)
- 文章/文档 (6)
- 单片机开发 (6)
- 书籍源码 (6)
- 人工智能/神经网络 (5)
- 汇编语言 (5)
- DSP编程 (5)
- 软件设计/软件工程 (5)
- Java书籍 (4)
- 教育系统应用 (4)
- 嵌入式综合 (3)
- 操作系统开发 (3)
- 游戏 (3)
- SQL Server (3)
- GPS编程 (3)
- 加密解密 (3)
- 文件格式 (3)
- 中间件编程 (3)
- 通讯编程文档 (3)
- 源码 (3)
- 单片机编程 (2)
- 无线通信 (2)
- Symbian (2)
- 交通/航空行业 (2)
- 驱动编程 (2)
- 串口编程 (2)
- 其他行业 (2)
- JavaScript (2)
- 嵌入式/单片机编程 (2)
- 技术管理 (2)
- 微处理器开发 (2)
- 金融证券系统 (2)
- 行业发展研究 (2)
- Delphi/CppBuilder (2)
- 教程资料 (1)
- C/C++语言编程 (1)
- 开发工具 (1)
- 实用工具 (1)
- 接口技术 (1)
- Applet (1)
- 其他数据库 (1)
- 企业管理 (1)
- 手机短信编程 (1)
- 嵌入式Linux (1)
- J2ME (1)
- 多国语言处理 (1)
- 系统设计方案 (1)
- STL (1)
- 医药行业 (1)
- Internet/网络编程 (1)
- USB编程 (1)
- *行业应用 (1)
- 压缩解压 (1)
- 家庭/个人应用 (1)
- 资料/手册 (1)
- 多媒体处理 (1)
- 其他 (1)
- 技术资料 (1)
- VIP专区 (1)
matlab例程 this is a zip file for showing how particle swarm optimization find g_best with matlab.
this is a zip file for showing how particle swarm optimization find g_best with matlab.
通讯编程文档 "Hard to find" full description of ContactID protocol from Ademco used by many home security devices
"Hard to find" full description of ContactID protocol from Ademco used by many home security devices to send messages to CMS (Central Monitoring Station) about security events.
Has full technical description and can be used to easy make CMS communication module that sends info from your alarm syst ...
书籍源码 program for astar algoritham to find cheapest path between two nodes
program for astar algoritham to find cheapest path between two nodes
Linux/Unix编程 The manual of GNU linker, LD. It is hard to find a pdf version of this document.
The manual of GNU linker, LD. It is hard to find a pdf version of this document.
数据结构 迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
迷宫算法（maze）
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your prog ...
matlab例程 Describes how to find the theta value in CPFSK
Describes how to find the theta value in CPFSK
行业发展研究 In this PDF you can find out how to use MAPLE for having QR and SVD decompositions on each dataset.
In this PDF you can find out how to use MAPLE for having QR and SVD decompositions on each dataset.
matlab例程 From the partial fraction expansion of H(z) we can find a, b
From the partial fraction expansion of H(z) we can find a, b
matlab例程 From the partial fraction expansion of H(z) we can find a, b
From the partial fraction expansion of H(z) we can find a, b
Java编程 to find class and ip adderss
to find class and ip adderss