搜索结果
找到约 1,018 项符合
NOT 的查询结果
按分类筛选
- 全部分类
- 书籍 (83)
- 其他 (57)
- Java编程 (50)
- 其他书籍 (49)
- 单片机编程 (41)
- 单片机开发 (37)
- matlab例程 (33)
- VC书籍 (26)
- Linux/Unix编程 (25)
- 电源技术 (24)
- 书籍源码 (24)
- 电子书籍 (24)
- 压缩解压 (20)
- 通讯编程文档 (19)
- Delphi控件源码 (18)
- 软件设计/软件工程 (18)
- 技术资料 (18)
- 可编程逻辑 (17)
- 驱动编程 (16)
- 微处理器开发 (15)
- 数学计算 (15)
- 文件格式 (15)
- VHDL/FPGA/Verilog (14)
- 数据结构 (14)
- 人工智能/神经网络 (14)
- 编译器/解释器 (13)
- 模拟电子 (12)
- 游戏 (12)
- Java书籍 (12)
- 文章/文档 (12)
- 软件工程 (11)
- 汇编语言 (10)
- 嵌入式/单片机编程 (10)
- 无线通信 (9)
- 网络 (9)
- 加密解密 (9)
- 行业发展研究 (9)
- 数值算法/人工智能 (9)
- 其他嵌入式/单片机内容 (9)
- 通讯/手机编程 (9)
- 技术管理 (8)
- 教程资料 (7)
- Internet/网络编程 (7)
- DSP编程 (7)
- 编辑器/阅读器 (6)
- PCB相关 (5)
- GPS编程 (5)
- SQL Server (5)
- 其他行业 (5)
- JavaScript (5)
- Jsp/Servlet (5)
- J2ME (5)
- 多国语言处理 (4)
- Applet (4)
- uCOS (4)
- 源码 (4)
- 数据库系统 (3)
- Delphi/CppBuilder (3)
- USB编程 (3)
- CA认证 (3)
- 系统设计方案 (3)
- 操作系统开发 (3)
- 企业管理 (3)
- FlashMX/Flex源码 (3)
- Mentor (2)
- 嵌入式综合 (2)
- C/C++语言编程 (2)
- Symbian (2)
- Windows CE (2)
- 嵌入式Linux (2)
- 其他数据库 (2)
- 串口编程 (2)
- Modem编程 (2)
- 中间件编程 (2)
- SCSI/ASPI (2)
- Ajax (2)
- 存储器技术 (2)
- Linux/uClinux/Unix编程 (2)
- 论文 (2)
- VIP专区 (2)
- uCOS编程 (1)
- 开发工具 (1)
- 实用工具 (1)
- 多媒体处理 (1)
- PCB图/BOM单/原理图 (1)
- allegro (1)
- 通信网络 (1)
- 教程资料 (1)
- 技术书籍 (1)
- 测试测量 (1)
- 源码/资料 (1)
- Windows Mobile (1)
- TAPI编程 (1)
- 生物技术 (1)
- Oracle数据库 (1)
- RFID编程 (1)
- VxWorks (1)
- 邮电通讯系统 (1)
- 金融证券系统 (1)
- 并行计算 (1)
DSP编程 In C Algorithms for Real-Time DSP, author Paul M. Embree presents a complete guide to digital signal
In C Algorithms for Real-Time DSP, author Paul M. Embree presents a complete guide to digital signal processing techniques in the C programming language. This book is structured in such a way that it will be most useful to the engineer who is familiar with DSP and the C language, but who is not nece ...
行业发展研究 In the last decade the processing of polygonal meshes has emerged as an active and very productive
In the last decade the processing of polygonal meshes has
emerged as an active and very productive research area. This
can basically be attributed to two developments:
Modern geometry acquisition devices, like laser scanners
and MRT, easily produce raw polygonal meshes of
ever growing complexity
D ...
系统设计方案 The most straightforward approximation is the standard Gaussian approximation, where the MAI is appr
The most straightforward approximation is the standard Gaussian approximation, where the MAI is approximated by a Gaussian random variable. This approximation is simple, however it is not accurate in general. In situations where the number of users is not large, the Gaussian approximation is not app ...
VC书籍 Please read your package and describe it at least 40 bytes. System will automatically delete the di
Please read your package and describe it at least 40 bytes.
System will automatically delete the directory of debug and release, so please do not put files on these two directory.
Linux/Unix编程 Novell.Press.Linux.Kernel.Development linux内核开发的经典书籍之一 The Linux kernel is one of the most interes
Novell.Press.Linux.Kernel.Development
linux内核开发的经典书籍之一
The Linux kernel is one of the most interesting yet least understood open-source projects. It is also a basis for developing new kernel code. That is why Sams is excited to bring you the latest Linux kernel development information fro ...
网络 Please read your package and describe it at least 40 bytes. System will automatically delete the di
Please read your package and describe it at least 40 bytes.
System will automatically delete the directory of debug and release, so please do not put files on these two directory.
其他 C in A Nutshell Learning a language--any language--involves a process wherein you learn to rely les
C in A Nutshell
Learning a language--any language--involves a process wherein you learn to rely less and less on instruction and more increasingly on the aspects of the language you ve mastered. Whether you re learning French, Java, or C, at some point you ll set aside the tutorial and attempt to co ...
数据结构 迷宫算法(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例程 This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3
This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum
pre-defined torque, without collision with any obstacle in the r ...