711 search results - page 60 / 143 » Amalgams of Constraint Satisfaction Problems |
161
click to vote
FLAIRS
2007
15 years 9 months ago
2007
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...
155
click to vote
FLAIRS
2006
15 years 8 months ago
2006
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
159
Voted
SBACPAD
2003
IEEE
15 years 12 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
153
Voted
CPAIOR
2004
Springer
16 years 2 days ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
170
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...