搜索结果
找到约 469 项符合
Problem 的查询结果
按分类筛选
- 全部分类
- 技术资料 (85)
- 人工智能/神经网络 (33)
- matlab例程 (32)
- 数学计算 (30)
- 其他 (29)
- 数值算法/人工智能 (24)
- 数据结构 (23)
- Java编程 (22)
- 其他书籍 (19)
- 书籍 (16)
- 软件设计/软件工程 (10)
- 电子书籍 (8)
- VC书籍 (8)
- 电源技术 (7)
- 单片机开发 (7)
- 行业发展研究 (7)
- Java书籍 (6)
- 并行计算 (6)
- 论文 (5)
- 单片机编程 (5)
- 可编程逻辑 (5)
- 文件格式 (5)
- 软件工程 (4)
- 教程资料 (4)
- Linux/Unix编程 (4)
- 文章/文档 (4)
- 加密解密 (3)
- 压缩解压 (3)
- 游戏 (3)
- 编译器/解释器 (3)
- 系统设计方案 (3)
- Linux/uClinux/Unix编程 (2)
- DSP编程 (2)
- 通讯/手机编程 (2)
- 操作系统开发 (2)
- 书籍源码 (2)
- 模拟电子 (2)
- Internet/网络编程 (2)
- 教育系统应用 (2)
- 汇编语言 (2)
- 嵌入式/单片机编程 (2)
- 其他 (1)
- C/C++语言编程 (1)
- 无线通信 (1)
- 数据库系统 (1)
- 其他文档 (1)
- 技术书籍 (1)
- 资料/手册 (1)
- 测试测量 (1)
- 工控技术 (1)
- 源码/资料 (1)
- 串口编程 (1)
- 编辑器/阅读器 (1)
- 磁盘编程 (1)
- 企业管理 (1)
- 传真(Fax)编程 (1)
- 金融证券系统 (1)
- 技术管理 (1)
- 其他数据库 (1)
- 通讯编程文档 (1)
- 嵌入式Linux (1)
- J2ME (1)
- 其他行业 (1)
- 生物技术 (1)
- 交通/航空行业 (1)
- Jsp/Servlet (1)
- VIP专区 (1)
数学计算 Resolution of the Cronig-Penney s predator and victim problem wrote in Matlab v6.5.
Resolution of the Cronig-Penney s predator and victim problem wrote in Matlab v6.5.
DSP编程 the program is used to find out the FFT using time in decimation and solves problem of dsp fft ,comp
the program is used to find out the FFT using time in decimation and solves problem of dsp fft ,compared with inbuilt fft and goertzel function , working well given with output also.
通讯编程文档 problem of blind demodulation of multiuser information symbols in a high-rate code-division multipl
problem of blind demodulation of multiuser
information symbols in a high-rate code-division multiple-access
(CDMA) network in the presence of both multiple-access interference
(MAI) and intersymbol interference (ISI) is considered.
其他书籍 Very hard to design reusable Software Design must be specific to problem on hand Design must be ge
Very hard to design reusable Software
Design must be specific to problem on hand
Design must be general enough to address future problems and requirements
Almost impossible to do it right the first time
Experienced designers don’t reinvent the wheel
They use good solutions again and again
Find & us ...
其他书籍 Very hard to design reusable Software Design must be specific to problem on hand Design must be ge
Very hard to design reusable Software
Design must be specific to problem on hand
Design must be general enough to address future problems and requirements
Almost impossible to do it right the first time
Experienced designers don’t reinvent the wheel
They use good solutions again and again
Find & us ...
其他书籍 Very hard to design reusable Software Design must be specific to problem on hand Design must be ge
Very hard to design reusable Software
Design must be specific to problem on hand
Design must be general enough to address future problems and requirements
Almost impossible to do it right the first time
Experienced designers don’t reinvent the wheel
They use good solutions again and again
Find & us ...
其他书籍 Very hard to design reusable Software Design must be specific to problem on hand Design must be ge
Very hard to design reusable Software
Design must be specific to problem on hand
Design must be general enough to address future problems and requirements
Almost impossible to do it right the first time
Experienced designers don’t reinvent the wheel
They use good solutions again and again
Find & us ...
人工智能/神经网络 this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this
this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this tar also include some testfiles and config file and a readme which describes how to run this program.
传真(Fax)编程 The problem with the IID_s is solved ! File-Structure: ~~~~~~~~~~~~~~~ DirectDraw.pas = DDraw.h
The problem with the IID_s is solved !
File-Structure:
~~~~~~~~~~~~~~~
DirectDraw.pas = DDraw.h + DVP.h (+ MultiMon.h)
Direct3D.pas = D3D.h + D3DTypes.h + D3DCaps.h + D3DVec.inl + DXFile.h
Direct3DRM.pas = D3DRM.h + D3DRMDef.h + D3DRMObj.h + D3DRMWin.h + RMXFGUID.h + RMXFTmpl.h
DirectInput.pas = DI ...
数值算法/人工智能 %this program is written by 刘学智. Finished time is 05.1.23 16:03 %utilizing it solving TSP problem
%this program is written by 刘学智. Finished time is 05.1.23 16:03
%utilizing it solving TSP problem by simulating stealing algorithm