Sciweavers

CP
2001
Springer
14 years 4 months ago
A CLP Approach to the Protein Side-Chain Placement Problem
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
Martin T. Swain, Graham J. L. Kemp
CP
2001
Springer
14 years 4 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
CP
2001
Springer
14 years 4 months ago
A Temporal Concurrent Constraint Programming Calculus
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
Catuscia Palamidessi, Frank D. Valencia
CP
2001
Springer
14 years 4 months ago
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, ...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
CP
2001
Springer
14 years 4 months ago
Solving Disjunctive Constraints for Interactive Graphical Applications
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
Kim Marriott, Peter Moulder, Peter J. Stuckey, Ala...
CP
2001
Springer
14 years 4 months 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
CP
2001
Springer
14 years 4 months ago
GAC on Conjunctions of Constraints
Abstract. Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be us...
George Katsirelos, Fahiem Bacchus
CP
2001
Springer
14 years 4 months ago
Optimal Pruning in Parametric Differential Equations
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
CP
2001
Springer
14 years 4 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
CP
2001
Springer
14 years 4 months ago
Symmetry Breaking
Torsten Fahle, Stefan Schamberger, Meinolf Sellman...