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
Variable and Value Ordering Heuristics for Hard Constraint Satisfaction Problems: An Application to Job Shop Scheduling
Norman Sadeh,Mark S. Fox +1 more
TL;DR: In this article, a probabilistic model of the search space is used to define new heuristics, which better account for the tightness of constrain and/or the connectivity of the constraint graph.
Journal ArticleDOI
A Similarity-Based Approach for Audiovisual Document Classification Using Temporal Relation Analysis
TL;DR: A novel approach for video classification that bases on the analysis of the temporal relationships between the basic events in audiovisual documents is proposed and a new representation method called Temporal Relation Matrix (TRM) is defined.
Dissertation
Structured interactive scores : from a structural description of a multimedia scenario to a real-time capable implementation with formal semantics
TL;DR: This dissertation proposes new semantics for interactive scores based on timed event structures and introduces two extensions of the formalism of interactive scores to handle audio processing using the Fast AUdio Stream (Faust) language and another one to handle conditional branching, allowing designers to specify choices and loops.
Proceedings ArticleDOI
Constraint Networks Under Conditional Uncertainty.
Matteo Zavatteri,Luca Viganò +1 more
TL;DR: This paper proposes constraint networks under conditional uncertainty (CNCUs), and it defines weak, strong and dynamic controllability of a CNCU, and provides algorithms to check each of these types of controllabilities.
Proceedings ArticleDOI
Risk-sensitive plan execution for connected sustainable home
TL;DR: It is demonstrated by simulations that p-Sulu significantly reduces the energy consumption compared to existing control approaches, while successfully limiting the risk of failure to satisfy residents' requirements.
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.