481 search results - page 62 / 97 » Martin's game: a lower bound for the number of sets |
CIE
2010
Springer
14 years 18 days ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
COCO
2010
Springer
14 years 18 days ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, the advantages of introducing an additional amount of tests when evolving parameters for specific purposes is discussed. A set of optimal PID-controller parameters...