Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

GEM
2007

favoriteEmaildiscussreport

96views Artificial Intelligence» more GEM 2007»

Searching for Snake-In-The-Box Codes With Evolved Pruning Models

13 years 5 months ago

Searching for Snake-In-The-Box Codes With Evolved Pruning Models

Download www.cs.uga.edu

We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique ﬁrst obtains a set of exemplary snakes using an evolutionary algorithm. These snakes are then analyzed to deﬁne a pruning model that constrains the search space. A depth-ﬁrst search of the constrained solution space has established new lower bounds for the length of the longest snakes in the 9 and 10 dimensional hypercube graphs.

Daniel R. Tuohy, Walter D. Potter, Darren A. Casel

Real-time Traffic

Artificial Intelligence | Exemplary Snakes | GEM 2007 | Hypercube Graphs | Technique ﬁrst Obtains |

claim paper

Related Content

» Using the Genetic Algorithm to Find SnakeintheBox Codes

» TAR Temporal Association Rules on Evolving Numerical Attributes

» Evolving an ecology of twotiered organizations

» FOGGER an algorithm for graph generator discovery

» Evolving Agents Communication and Cognition

» Solving onebillionbit Noisy OneMax problem using Estimation Distribution Algorithm with Ar...

» The Volcano Optimizer Generator Extensibility and Efficient Search

» Learning recursive programs with cooperative coevolution of genetic code mapping and genot...

» A novel approach to optimize clone refactoring activity

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	GEM
Authors	Daniel R. Tuohy, Walter D. Potter, Darren A. Casella

Comments (0)