搜索：Geometric+Algorithm
找到约 1,261 项符合「Geometric+Algorithm」的查询结果
结果 1,261
按分类筛选
- 全部
- matlab例程 (149)
- 人工智能/神经网络 (100)
- 数学计算 (76)
- 加密解密 (70)
- 数值算法/人工智能 (52)
- 技术资料 (44)
- 其他 (41)
- 数据结构 (31)
- 压缩解压 (27)
- 其他书籍 (26)
- Java编程 (25)
- 软件设计/软件工程 (18)
- 通讯/手机编程 (16)
- 文章/文档 (16)
- 书籍源码 (13)
- 通讯编程文档 (13)
- Linux/Unix编程 (11)
- 技术管理 (11)
- VHDL/FPGA/Verilog (10)
- DSP编程 (9)
- 单片机开发 (9)
- 文件格式 (8)
- 系统设计方案 (8)
- 软件工程 (7)
- 电子书籍 (7)
- JavaScript (7)
- 操作系统开发 (5)
- CA认证 (5)
- 汇编语言 (5)
- 行业发展研究 (5)
- 驱动编程 (4)
- 编辑器/阅读器 (4)
- 多国语言处理 (4)
- 其他嵌入式/单片机内容 (4)
- 书籍 (4)
- 其他数据库 (3)
- 嵌入式/单片机编程 (3)
- STL (3)
- VC书籍 (3)
- GPS编程 (3)
- 游戏 (2)
- 编译器/解释器 (2)
- *行业应用 (2)
- 网络 (2)
- 其他行业 (2)
- 中间件编程 (2)
- 并行计算 (2)
- Linux/uClinux/Unix编程 (1)
- 设计相关 (1)
- 数据库系统 (1)
- 教程资料 (1)
- Modem编程 (1)
- 语音压缩 (1)
- 磁盘编程 (1)
- Applet (1)
- 微处理器开发 (1)
- Java书籍 (1)
- J2ME (1)
- 家庭/个人应用 (1)
- 生物技术 (1)
- Jsp/Servlet (1)
- RFID编程 (1)
- 3G开发 (1)
- 源码 (1)
- 论文 (1)
- 习题答案 (1)
https://www.eeworm.com/dl/663/469405.html
VHDL/FPGA/Verilog
In this work an implementation of a geometric nonlinear controller for chaos synchronization in a Fi
In this work an implementation of a geometric nonlinear controller for chaos synchronization in a Field Programmable Gate Array (FPGA) is presented. The Lorenz chaotic system is used to show the implementation of chaos synchronization via nonlinear controller implemented in a Xil ...
https://www.eeworm.com/dl/cadence/ebook/426927.html
电子书籍
Quantization algorithm
Quantization algorithm
https://www.eeworm.com/dl/650/181850.html
人工智能/神经网络
Aprior algorithm coded by the writer of aprior algorithm
Aprior algorithm coded by the writer of aprior algorithm
https://www.eeworm.com/dl/665/457945.html
matlab例程
matlab code to calculate the MUSIC algorithm(DOA algorithm)
matlab code to calculate the MUSIC algorithm(DOA algorithm)
https://www.eeworm.com/dl/648/466322.html
单片机开发
In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determ
In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not require factoring the two inte ...