CP
2005
Springer
13 years 10 months ago
2005
Springer
CP
2005
Springer
13 years 10 months ago
2005
Springer
CP
2005
Springer
13 years 10 months ago
2005
Springer
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
CP
2005
Springer
13 years 10 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this article we will present some problems that have weak symmetries. In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and pres...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
CP
2005
Springer
13 years 10 months ago
2005
Springer
In the context of previous work on redundant modeling, permutation problems and matrix modeling, we introduce the notion of partial redundant modeling and categorical channeling co...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...
CP
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...