250 search results - page 5 / 50 » The complexity of temporal constraint satisfaction problems |
CISSE
2009
Springer
15 years 3 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
120
click to vote
AAAI
2006
15 years 1 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
100
click to vote
AAAI
1998
15 years 29 days ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
110
click to vote
CIE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...