2899 search results - page 313 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
153
click to vote
GLOBECOM
2006
IEEE
16 years 19 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
171
click to vote
SPAA
2005
ACM
16 years 4 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
154
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
194
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
164
click to vote
EMO
2005
Springer
16 years 3 days ago
2005
Springer
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...