2252 search results - page 223 / 451 » Lower Bounds for Dynamic Algorithms |
118
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
112
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
176
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
127
click to vote
VLSID
1994
IEEE
15 years 8 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
135
click to vote
COLT
1994
Springer
15 years 8 months ago
1994
Springer
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...