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
Journal ArticleDOI
New trends in constraint satisfaction, planning, and scheduling: a survey
TL;DR: This paper presents a survey on constraint satisfaction, planning, and scheduling from the Artificial Intelligence point of view, and presents the main definitions and techniques.
Journal ArticleDOI
A Multiagent-Based Decision-Making System for Semiconductor Wafer Fabrication With Hard Temporal Constraints
Hyun Joong Yoon,Weiming Shen +1 more
TL;DR: In this paper, a decision-making system for semiconductor wafer fabrication facilities, or wafer fabs, with hard interoperation temporal constraints was developed based on a multiagent architecture that is composed of scheduling agents, workcell agents, machine agents, and product agents.
Proceedings Article
System architecture for temporal information extraction, representation and reasoning in clinical narrative reports.
TL;DR: This work proposes an architecture for an integrated approach to process temporal information in clinical narrative reports that supports applications which assist healthcare practice and research by including the ability to determine the time of clinical events.
Journal ArticleDOI
Optimal rectangle packing: an absolute placement approach
Eric J. Huang,Richard E. Korf +1 more
TL;DR: These algorithms represent the current state-of-the-art for this problem, outperforming other algorithms by orders of magnitude, depending on the benchmark, and introduce three new benchmarks, avoiding properties that make a benchmark easy, such as rectangles with shared dimensions.
Journal ArticleDOI
Temporal similarity measures for querying clinical workflows
TL;DR: This work describes a possible approach to the conceptual modeling of a clinical process, by using a temporally extended workflow model, and defines how a workflow case can be represented as a set of activities, and shows how to express them through temporal constraint networks.
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.