2200 search results - page 53 / 440 » Bloch's Constant is Computable |
106
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
101
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
CVPR
2000
IEEE
15 years 12 months ago
2000
IEEE
We consider a scene, containing many objects moving with constant velocity along straight line paths, seen from three reference viewpoints at three different times.The scene may e...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
100
click to vote
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...