16093 search results - page 386 / 3219 » On the optimality of the neighbor-joining algorithm |
190
click to vote
CIDU
2010
15 years 4 months ago
2010
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
169
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
167
click to vote
PDCAT
2007
Springer
16 years 1 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
192
click to vote
GECCO
2005
Springer
16 years 12 days ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
187
click to vote
ICIC
2005
Springer
16 years 12 days ago
2005
Springer
This paper proposed a modified algorithm, sequential niching particle swarm optimization (SNPSO), for the attempt to get multiple maxima of multimodal function. Based on the sequen...