142 search results - page 20 / 29 » ecai 2008 |
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
A temporal constraint management system (TCMS) is a temporal network together with algorithms for managing the constraints in that network over time. This paper presents a practica...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Recent contributions to advancing planning from the classical model to more realistic problems include using temporal logic such as LTL to express desired properties of a solution ...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
The use of rules in business modeling is becoming more and more important, in applications requiring dynamic change of behavior. A number of rule languages and tools have been prop...