搜索结果
找到约 76 项符合
optimal 的查询结果
按分类筛选
- 全部分类
- matlab例程 (13)
- 其他书籍 (5)
- 书籍 (5)
- 单片机开发 (4)
- 其他 (4)
- 人工智能/神经网络 (3)
- 文章/文档 (3)
- 数学计算 (3)
- 数值算法/人工智能 (3)
- 通讯/手机编程 (3)
- 电源技术 (2)
- 多国语言处理 (2)
- Linux/Unix编程 (2)
- 操作系统开发 (2)
- 数据结构 (2)
- 论文 (2)
- 技术资料 (2)
- Mentor (1)
- 单片机编程 (1)
- 可编程逻辑 (1)
- 数据库系统 (1)
- VC书籍 (1)
- 行业发展研究 (1)
- 金融证券系统 (1)
- 文件格式 (1)
- 书籍源码 (1)
- 系统设计方案 (1)
- Java编程 (1)
- 3G开发 (1)
- 压缩解压 (1)
- 电子书籍 (1)
- 软件设计/软件工程 (1)
- 学术论文 (1)
其他书籍 Carrier-phase synchronization can be approached in a general manner by estimating the multiplicativ
Carrier-phase synchronization can be approached in a
general manner by estimating the multiplicative distortion (MD) to which
a baseband received signal in an RF or coherent optical transmission
system is subjected. This paper presents a unified modeling and
estimation of the MD in finite-alphabet d ...
文章/文档 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 ...
matlab例程 PRINCIPLE: PLS cross-validation using the SIMPLS or WIMPLS algorithm, respectively for tall or wide
PRINCIPLE: PLS cross-validation using the SIMPLS or WIMPLS algorithm, respectively for tall or wide X-data. The optimal approach is selected automatically.
其他书籍 The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some no
The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a ...
其他 The basic principle using the branchand- bound strategy to solve the traveling salesperson optimiz
The basic principle using the branchand-
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
&#1048708 There is a way to split the solution space.
&#1048708 There is a way to predict a lower bound for a
class of solutions.
&#1048708 There is also a way ...
通讯/手机编程 In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for un
In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for uniformly quantized synchronous code division multiple access (CDMA) signals in additive white Gaussian noise (AWGN) channels.This project is mainly based on the representation of uniform quantizer by ...
文章/文档 In an electromagnetic cloak based on a transformation approach, reduced sets of material properties
In an electromagnetic cloak based on a transformation approach, reduced sets of
material properties are generally favored due to their easier implementation in reality,
although a seemingly inevitable drawback of undesired reflection exists in such cloaks.
Here we suggest using high-order transforma ...
matlab例程 OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented i
OTSU Gray-level image segmentation using Otsu s method.
Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes
by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection
Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern.
9:62-66 1979). Thre ...
通讯/手机编程 WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a man
WSNs being energy constrained systems, one major problem is to employ the sensor nodes in such a manner so as to ensure maximum coverage and connectivity with minimal or optimal number of nodes and furthermore elongate network lifetime with maximum energy utilization.
The problem addressed has b ...
人工智能/神经网络 Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two
Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a const ...