Incremental computation of resource-envelopes in producer-consumer models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 664-678

  Kumar, T K Satish ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CESIUM; COMPUTER PROGRAMMING; CONSTRAINT THEORY; DIRECTED GRAPHS; GRAPH THEORY; SCHEDULING;

ENVELOPE FUNCTIONS; INCREMENTAL ALGORITHM; INCREMENTAL COMPUTATION; PLANNING AND SCHEDULING; RESOURCE CONSUMPTION; RESOURCE ENVELOPES; SCHEDULING CONSTRAINTS; TEMPORAL INFORMATION;

COMPUTATIONAL EFFICIENCY;

EID: 13444260388     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_45     Document Type: Article

References (6)

1. Cormen T. H., Leiserson, C. E. and Rivest, R. L. Introduction to Algorithms. Cambridge, MA, 1990.
2. Laborie P. Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results. ECP 2001.
3. Muscettola N. On the Utility of Bottleneck Reasoning for Scheduling. AAAI 1994.
4. Muscettola N. Computing the Envelope for Stepwise-Constant Resource Allocations. CP 2002.
5. Smith D., Frank J. and Jonsson A. Bridging the Gap Between Planning and Scheduling. Knowledge Engineering Review 15:1, 2000.
6. Nguyen X. and Kambhampati S. Reviving Partial Order Planning. IJCAI-2001.