10051 search results - page 236 / 2011 » A Dynamic Separator Algorithm |
151
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
146
click to vote
WEA
2007
Springer
16 years 15 days ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
168
click to vote
ICPP
1996
IEEE
15 years 10 months ago
1996
IEEE
: We study the scalability of 2-D discrete wavelet transform algorithms on fine-grained parallel architectures. The principal operation in the 2-D DWT is the filtering operation us...
138
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents four rotatable multi-objective test problems that are designed for testing EMO (Evolutionary Multiobjective Optimization) algorithms on their ability in dealin...
167
click to vote
RSS
2007
15 years 7 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...