Sciweavers

52 search results - page 1 / 11
» Phase Transitions in Classical Planning: An Experimental Stu...
Sort
View
RSA
2010
98views more  RSA 2010»
13 years 2 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier
JAC
2008
13 years 6 months ago
An exhaustive experimental study of synchronization by forcing on elementary cellular automata
We study a way of coupling two configurations of the same cellular automaton rule for all elementary cellular automata (ECA). We experimentally show that there are only two possibl...
Jean-Baptiste Rouquier
IJAMCIGI
2010
94views more  IJAMCIGI 2010»
12 years 11 months ago
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover
JAIR
2010
90views more  JAIR 2010»
12 years 11 months ago
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
Gerold Jäger, Weixiong Zhang