327 search results - page 20 / 66 » Algorithms for infinite huffman-codes |
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
We present a genetic model based on simulated recombination of fixed sequences of quaternary genes (assuming four distinct forms, or alleles). States and dynamics of the infinite ...
IJRR
2010
13 years 8 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occ...
ANTS
2006
Springer
14 years 2 months ago
2006
Springer
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois grou...
CCCG
2010
14 years 11 days ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...