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
Energy-Efficient IoT Service Composition for Concurrent Timed Applications
TL;DR: This paper proposes to identify and share common functional components, and thus, to integrate and optimize concurrent requests, where a component corresponds to a snippet of IoT service compositions.
Proceedings ArticleDOI
Distributed coordination of mobile agent teams: the advantage of planning ahead
TL;DR: An agent architecture is described that uses the synergy between intra-agent scheduling and inter-agent coordination to promote task allocation decisions that minimize travel time and maximize time available for utility-acrruing activities.
Proceedings ArticleDOI
Structured motifs search
TL;DR: An algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints, that combines standard pattern matching procedures with a constraint satisfaction solver and has the ability, not present in similar tools, to search for partial matches.
Journal ArticleDOI
A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
Melissa Sanchez,Jorge M. Cruz-Duarte,José Carlos Ortiz-Bayliss,Hector G. Ceballos,Hugo Terashima-Marín,Iván Amaya +5 more
TL;DR: This work begins by determining the most relevant combinatorial optimization problems, and then it analyzes them in the context of hyper-heuristics to verify whether they remain as relevant when considering exclusively works related to hyper- heuristics.
Journal ArticleDOI
Solving strong controllability of temporal problems with uncertainty using SMT
TL;DR: This paper obtains the first practical and comprehensive solution for strong controllability, i.e. finding an assignment to all the controllable time points, such that the constraints are fulfilled under any possible assignment of uncontrollably time points.
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.