Sciweavers

235 search results - page 2 / 47
» An efficient consistency algorithm for the Temporal Constrai...
Sort
View
AAAI
2004
13 years 6 months ago
Low-cost Addition of Preferences to DTPs and TCSPs
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
Bart Peintner, Martha E. Pollack
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 5 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
AIR
2005
111views more  AIR 2005»
13 years 5 months ago
An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
Georg Ringwelski
CP
1999
Springer
13 years 9 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz
AAAI
2006
13 years 6 months ago
Weighted Constraint Satisfaction with Set Variables
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
J. H. M. Lee, C. F. K. Siu