1013 search results - page 8 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
79
Voted
ESA
2010
Springer
14 years 10 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
79
Voted
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
75
Voted
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
103
click to vote
ANTSW
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...