Sciweavers

24 search results - page 5 / 5
» Improving Backtrack Search for Solving the TCSP
Sort
View
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 7 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...
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
IJCAI
2003
13 years 9 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
AAAI
2000
13 years 9 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava