277 search results - page 5 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
IBERAMIA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
AAAI
1990
13 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
ICTAI
2008
IEEE
14 years 1 months ago
2008
IEEE
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
CP
1995
Springer
13 years 11 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
SIAMJO
2008
13 years 7 months ago
2008
Second-order sufficient optimality conditions are established for the optimal control of semilinear elliptic and parabolic equations with pointwise constraints on the control and t...