2899 search results - page 78 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
138
click to vote
INFOCOM
2010
IEEE
14 years 12 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
108
click to vote
TEC
2008
15 years 1 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
IJACTAICIT
2010
14 years 10 months ago
2010
In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
122
click to vote
GECCO
2009
Springer
14 years 11 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...