219 search results - page 22 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
ALGORITHMICA
2005
13 years 8 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...