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
Book ChapterDOI
Managing Decision Tasks and Events in Time-Aware Business Process Models
TL;DR: This paper discusses how to add temporal features to process elements, characterize decisions based on when they are made and used within a process and deal with intertwined temporal and decision aspects of time-aware BPMN processes to ensure proper execution.
Proceedings ArticleDOI
A Faster Execution Algorithm for Dynamically Controllable STNUs
TL;DR: An O(N3)-time execution algorithm for DC STNUs is presented, the fastest reported so far, and the increase in speed is due to more efficient management of the so-called ``wait'' constraints, which must be removed from the network whenever the corresponding contingent link completes.
Journal ArticleDOI
Fault diagnosis method of distribution network based on time sequence hierarchical fuzzy petri nets
TL;DR: A novel fault diagnosis method based on time sequence hierarchical fuzzy Petri nets (TSHFPNs) is proposed for distribution network and Gaussian function is introduced to optimize the fault probability and improve the accuracy of fault diagnosis results.
BookDOI
VLSI for Neural Networks and Artificial Intelligence
TL;DR: Analog Circuits for Neural Networks: Analog VLSI Neural Learning Circuits (H.C. Card).
Journal ArticleDOI
Iterative flattening search for resource constrained scheduling
TL;DR: Comparative results on well-studied benchmark problems are presented that clarify this tradeoff with respect to previously proposed flattening strategies, identify qualitative guidelines for the design of effective ifs procedures, and suggest some new directions for future work in this area.
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.