Journal ArticleDOI
Temporal constraint networks
TLDR
It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.About:
This article is published in Artificial Intelligence.The article was published on 1991-05-01. It has received 1989 citations till now. The article focuses on the topics: Constraint satisfaction problem & Constraint satisfaction.read more
Citations
More filters
Proceedings Article
Mixed discrete-continuous heuristic generative planning based on flow tubes
TL;DR: Scotty is introduced, a mixed discrete-continuous generative planner that finds the middle ground between these two temporal planners, and exploits the expressivity of flow tubes, which compactly encapsulate continuous effects, and the performance of heuristic forward search.
Proceedings ArticleDOI
Time representation and management in MADEUS: an authoring environment for multimedia documents
TL;DR: The currently achieved results of the research goal are presented: building an easy to use and powerful multimedia documents authoring environment, which provides high level of expressiveness and open document format.
Proceedings Article
Robust execution of contingent, temporally flexible plans
TL;DR: The plan extraction component of a robust, distributed executive for contingent plans is introduced, which reduces the computational load on each agent and tests the temporal consistency of each candidate plan using a distributed Bellman-Ford algorithm.
Book ChapterDOI
HYBRID PROBLEM SOLVING IN ECLiPSe
Farid Ajili,Mark Wallace +1 more
TL;DR: This chapter shows how the hybrid search can be elegantly programmed in ECLiPSe through an implementation of a generic hybrid algorithm applied on a general resource-constrained scheduling problem with a widely applicable objective function.
Proceedings ArticleDOI
Free schedules for free agents in workflow systems
TL;DR: The paper provides a method to characterize all the free schedules admitted by a workflow specification and an algorithm to derive them, and identifies a particularly useful class: free schedules.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal Article
Maintaining knowledge about temporal intervals
TL;DR: An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.
Journal ArticleDOI
Maintaining knowledge about temporal intervals
TL;DR: In this paper, an interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between time and space.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Journal ArticleDOI
Consistency in Networks of Relations
TL;DR: The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.