2899 search results - page 22 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
134
click to vote
TKDE
2008
15 years 5 months ago
2008
We present a genetic algorithm for tackling a file assignment problem for a large-scale video-on-demand system. The file assignment problem is to find the optimal replication and a...
144
click to vote
DAGSTUHL
2004
15 years 6 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
154
click to vote
WDAG
2004
Springer
15 years 10 months ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
136
click to vote
COR
2008
15 years 5 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
147
click to vote
SMA
2005
ACM
15 years 10 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...