10608 search results - page 50 / 2122 » Complexity of O'Hara's Algorithm |
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
WDAG
2007
Springer
14 years 4 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
IWANN
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...
COCO
2000
Springer
14 years 1 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
DMTCS
2003
13 years 11 months ago
2003
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...