Sciweavers

150 search results - page 18 / 30
» Solving Permutation Constraint Satisfaction Problems with Ar...
Sort
View
CP
2008
Springer
15 years 1 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
CP
2009
Springer
15 years 3 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...
CP
1997
Springer
15 years 3 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
EVOW
2001
Springer
15 years 4 months ago
Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
Marc Bufé, Tim Fischer, Holger Gubbels, Cla...
CORR
2010
Springer
124views Education» more  CORR 2010»
14 years 11 months ago
Symmetry within and between solutions
Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive...
Toby Walsh