Sciweavers

105 search results - page 7 / 21
» A Fast and Space - Economical Algorithm for Length - Limited...
Sort
View
GEM
2007
13 years 10 months ago
Searching for Snake-In-The-Box Codes With Evolved Pruning Models
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel...
AAECC
2009
Springer
136views Algorithms» more  AAECC 2009»
14 years 3 months ago
There Are Not Non-obvious Cyclic Affine-invariant Codes
We show that an affine-invariant code C of length pm is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or it...
José Joaquín Bernal, Ángel de...
IEAAIE
1994
Springer
14 years 20 days ago
Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
RECOMB
2001
Springer
14 years 9 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
DCC
2003
IEEE
14 years 8 months ago
Code Compression Using Variable-to-fixed Coding Based on Arithmetic Coding
Embedded computing systems are space and cost sensitive; memory is one of the most restricted resources, posing serious constraints on program size. Code compression, which is a s...
Yuan Xie, Wayne Wolf, Haris Lekatsas