搜索结果
找到约 384 项符合
Problem 的查询结果
按分类筛选
- 全部分类
- 人工智能/神经网络 (33)
- matlab例程 (32)
- 数学计算 (30)
- 其他 (29)
- 数值算法/人工智能 (23)
- Java编程 (22)
- 其他书籍 (19)
- 书籍 (16)
- 数据结构 (15)
- 软件设计/软件工程 (10)
- 技术资料 (10)
- VC书籍 (8)
- 电子书籍 (8)
- 电源技术 (7)
- 单片机开发 (7)
- 行业发展研究 (7)
- Java书籍 (6)
- 并行计算 (6)
- 单片机编程 (5)
- 可编程逻辑 (5)
- 文件格式 (5)
- 教程资料 (4)
- 文章/文档 (4)
- Linux/Unix编程 (4)
- 软件工程 (4)
- 论文 (4)
- 游戏 (3)
- 系统设计方案 (3)
- 压缩解压 (3)
- 加密解密 (3)
- 编译器/解释器 (3)
- 模拟电子 (2)
- 教育系统应用 (2)
- 汇编语言 (2)
- 嵌入式/单片机编程 (2)
- 书籍源码 (2)
- 通讯/手机编程 (2)
- DSP编程 (2)
- Internet/网络编程 (2)
- 操作系统开发 (2)
- Linux/uClinux/Unix编程 (2)
- 无线通信 (1)
- 工控技术 (1)
- 测试测量 (1)
- 源码/资料 (1)
- 数据库系统 (1)
- 生物技术 (1)
- 传真(Fax)编程 (1)
- 嵌入式Linux (1)
- J2ME (1)
- 磁盘编程 (1)
- 金融证券系统 (1)
- 串口编程 (1)
- Jsp/Servlet (1)
- 技术管理 (1)
- 企业管理 (1)
- 编辑器/阅读器 (1)
- 通讯编程文档 (1)
- 交通/航空行业 (1)
- 其他数据库 (1)
- 其他行业 (1)
- 资料/手册 (1)
- 技术书籍 (1)
- C/C++语言编程 (1)
- 其他文档 (1)
- 其他 (1)
- VIP专区 (1)
数据结构 Data Abstraction & Problem Solving with C++源码
Data Abstraction & Problem Solving with C++源码
Java编程 source codes to solve Hexpuzzle problem
source codes to solve Hexpuzzle problem
人工智能/神经网络 这是一个用遗传算法来求解旅行商问题(TSP问题:Travelling Salesman Problem)的源代码
这是一个用遗传算法来求解旅行商问题(TSP问题:Travelling Salesman Problem)的源代码,学习遗传算法,演化计算的很值得一看!
文章/文档 Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optim
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal tra ...
数据结构 datastructure, algorithms in C++ problem soloution
datastructure, algorithms in C++
problem soloution
数据结构 using greedy trategy to solve the problem of multiOptimalServe.this code runs in vc 6.0.
using greedy trategy to solve the problem of multiOptimalServe.this code runs in vc 6.0.
数据结构 using greedy tratage to solve the problem of Number Delete.
using greedy tratage to solve the problem of Number Delete.
电子书籍 The problem of ¯ nding a linear discriminant function will be formulated as a problem of minimi
The problem of ¯ nding a linear discriminant function will be formulated as a problem
of minimizing a criterion function
游戏 java puzzle eight problem solution
java puzzle eight problem solution
软件设计/软件工程 map identification laquo yuan Problem description : the digital image processing of an image often e
map identification laquo yuan Problem description : the digital image processing of an image often expressed as a macute M pixel matrix. Each pixel value is 0 or 1. The value of 0 pixel image, said background, and the value of a pixel image, said a map of a million, usually called map million pixels ...