19 search results - page 4 / 4 » Backtracking Algorithms for Disjunctions of Temporal Constra... |
103
click to vote
PRICAI
2004
Springer
15 years 4 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
AMAI
1999
Springer
14 years 10 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
104
Voted
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
107
click to vote
AIPS
2009
15 years 5 days ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...