Sciweavers

400 search results - page 36 / 80
» A Synthesis of Constraint Satisfaction and Constraint Solvin...
Sort
View
FLAIRS
2007
13 years 10 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
ATAL
2003
Springer
14 years 29 days ago
A multiagent-system for integrating a large-scale project
This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned ...
Carlos Eisenberg, Boi Faltings, Lars Leistam
CP
1999
Springer
14 years 7 hour ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CP
2001
Springer
14 years 6 days ago
Solving Non-binary CSPs Using the Hidden Variable Encoding
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
Nikos Mamoulis, Kostas Stergiou