Fast (incremental) algorithms for useful classes of simple temporal problems with preferences

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1954-1959

  Kumar, T K Satish ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXECUTION MONITORING; INCREMENTAL ALGORITHM; OBJECTIVE FUNCTIONS; PIECEWISE LINEAR; POLYNOMIAL-TIME ALGORITHMS; PREFERENCE FUNCTIONS; PREFERRED SOLUTIONS; SIMPLE TEMPORAL PROBLEMS;

ALGORITHMS; PIECEWISE LINEAR TECHNIQUES;

PROBLEM SOLVING;

EID: 37149005165     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Ahuja R. K., Magnanti T. L. and Orlin J. B. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey.
2. Dechter R., Meiri I. and Pearl J. 1991. Temporal Constraint Networks. Artificial Intelligence, Vol. 49.
3. Goldberg A. V. and Tarjan R. E. 1989. Finding Minimum-Cost Circulations by Cancelling Negative Cycles. Journal of ACM 36(1989), 873-886.
4. Hartline J. and Sharp A. 2005. Incremental Flow. www.cs.cornell.edu/w8/ ~jhartlin/incflow.pdf
5. Khatib L., Morris P., Morris R. and Rossi F. 2001. Temporal Constraint Reasoning with Preferences. Proceedings of IJCAI'2001.
6. Kumar T. K. S. 2003. Incremental Computation of Resource-Envelopes in Producer-Consumer Models. Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP'2003).
7. Kumar T. K. S. 2004. A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions. Proceedings of the 19th National Conference on Artificial Intelligence (AAAI'2004).
8. Kumar T. K. S. 2005. On the Tractability of Restricted Disjunctive Temporal Problems. Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS'2005).
9. Morris P., Morris R., Khatib L., Ramakrishnan S. and Bachmann A. 2004. Strategies for Global Optimization of Temporal Preferences. Proceedings of CP'2004.
10. Muscettola N. 2004. Incremental Maximum Flows for Fast Envelope Computation. ICAPS'2004.
11. Orlin J. B. 1988. A Faster Strongly Polynomial Minimum Cost Flow Algorithm. STOC'1988.
12. Stergiou K. and Koubarakis M. 1998. Backtracking Algorithms for Disjunctions of Temporal Constraints. Proceedings of AAAI'1998.
13. Sultan A. 1993. Linear Programming: An Introduction with Applications. San Diego: Academic Press, 1993.