Sciweavers

SODA
2003
ACM
125views Algorithms» more  SODA 2003»
14 years 26 days ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
ICMLA
2007
14 years 28 days ago
Phase transition and heuristic search in relational learning
Several works have shown that the covering test in relational learning exhibits a phase transition in its covering probability. It is argued that this phase transition dooms every...
Érick Alphonse, Aomar Osmani
CP
2008
Springer
14 years 1 months ago
Crossword Puzzles as a Constraint Problem
We present new results in crossword composition, showing that our program significantly outperforms previous successful techniques in the literature. We emphasize phase transition ...
Anbulagan, Adi Botea
COMPGEOM
2008
ACM
14 years 1 months ago
The complexity of the outer face in arrangements of random segments
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
ANTSW
2008
Springer
14 years 1 months ago
Modeling Phase Transition in Self-organized Mobile Robot Flocks
We implement a self-organized flocking behavior in a group of mobile robots and analyze its transition from an aligned state to an unaligned state. We briefly describe the robot an...
Ali Emre Turgut, Cristián Huepe, Hande &Cce...
ECAI
1994
Springer
14 years 3 months ago
The SAT Phase Transition
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
Ian P. Gent, Toby Walsh
CP
2000
Springer
14 years 3 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
CP
2004
Springer
14 years 4 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
ACRI
2004
Springer
14 years 4 months ago
Perturbing the Topology of the Game of Life Increases Its Robustness to Asynchrony
An experimental analysis of the asynchronous version of the “Game of Life” is performed to estimate how topology perturbations modify its evolution. We focus on the study of a ...
Nazim Fatès, Michel Morvan
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 5 months ago
Phase transition in a random NK landscape model
An analysis for the phase transition in a random NK landscape model is given. For the fixed ratio model, NK(n, k, z), Gao and Culberson [17] showed that a random instance generat...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim