Sciweavers

DAGSTUHL
2006
13 years 5 months ago
Binary Lambda Calculus and Combinatory Logic
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
John Tromp
DAGSTUHL
2006
13 years 5 months ago
Automatic Meaning Discovery Using Google
We have found a method to automatically extract the meaning of words and phrases from the world-wide-web using Google page counts. The approach is novel in its unrestricted proble...
Rudi Cilibrasi, Paul M. B. Vitányi
DAGSTUHL
2006
13 years 5 months ago
06051 Abstracts Collection -- Kolmogorov Complexity and Applications
Marcus Hutter, Wolfgang Merkle, Paul M. B. Vit&aac...
DAGSTUHL
2006
13 years 5 months ago
Adaptive Analysis of On-line Algorithms
Reza Dorrigiv, Alejandro López-Ortiz
DAGSTUHL
2006
13 years 5 months ago
Competitive Online Searching for a Ray in the Plane
We consider the problem of a searcher that looks for a lost flashlight in a dusty environment. The search agent finds the flashlight as soon as it crosses the ray emanating from t...
Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans,...
DAGSTUHL
2006
13 years 5 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
DAGSTUHL
2006
13 years 5 months ago
06061 Abstracts Collection -- Theory of Evolutionary Algorithms
Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, M...
DAGSTUHL
2006
13 years 5 months ago
How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
Boris Mitavskiy, Jonathan E. Rowe