Sciweavers

1051 search results - page 77 / 211
» Foundations of Constraint Satisfaction
Sort
View
CSCLP
2004
Springer
14 years 3 months ago
Super Solutions for Combinatorial Auctions
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
Alan Holland, Barry O'Sullivan
ECAI
2004
Springer
14 years 3 months ago
Tractable Symmetry Breaking Using Restricted Search Trees
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...
ECAIW
2000
Springer
14 years 2 months ago
Solving the Sports League Scheduling Problem with Tabu Search
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
Jean-Philippe Hamiez, Jin-Kao Hao
CP
1999
Springer
14 years 2 months ago
The Goldilocks Problem
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
Tudor Hulubei, Eugene C. Freuder
EVOW
2006
Springer
14 years 1 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...