Sciweavers

223 search results - page 1 / 45
» Parallel Algorithms for Encoding and Decoding Blob Code
Sort
View
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
14 years 5 months ago
Parallel Algorithms for Encoding and Decoding Blob Code
Saverio Caminiti, Rossella Petreschi
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 5 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 4 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
TIT
2002
85views more  TIT 2002»
13 years 10 months ago
Parallel constrained coding with application to two-dimensional constraints
A parallel constrained coding scheme is considered where p-blocks of raw data are encoded simultaneously into q tracks such that the contents of each track belong to a given const...
Shirley Halevy, Ron M. Roth