Artificial Intelligence
Real-time knowledge-based systems
AI Magazine
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Solving Time-Dependent Planning Problems
Solving Time-Dependent Planning Problems
Anytime approximate model reasoning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
BIG: a resource-bounded information gathering agent
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Formally Verifying Dynamic Properties of Knowledge Based Systems
EKAW '99 Proceedings of the 11th European Workshop on Knowledge Acquisition, Modeling and Management
Design-to-Criteria Scheduling: Real-Time Agent Control
Revised Papers from the International Workshop on Infrastructure for Multi-Agent Systems: Infrastructure for Agents, Multi-Agent Systems, and Scalable Multi-Agent Systems
Implementing a Flexible Scheduler in Ada
Ada Europe '01 Proceedings of the 6th Ade-Europe International Conference Leuven on Reliable Software Technologies
Adaptive parameter control of evolutionary algorithms to improve quality-time trade-off
Applied Soft Computing
A multi-agent-based approach for personnel scheduling in assembly centers
Engineering Applications of Artificial Intelligence
Anytime Reasoning Mechanism for Conversational Agents
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
Anytime Reasoning Mechanism for Conversational Agents
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
Incremental speech translation
Incremental speech translation
Quantitative modeling of complex computational task environments
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Task interdependencies in design-to-time real-time scheduling
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
An agent-based algorithm for personnel shift-scheduling and rescheduling in flexible assembly lines
Journal of Intelligent Manufacturing
Renormalisation and computation ii: Time cut-off and the halting problem
Mathematical Structures in Computer Science
Hi-index | 0.00 |
We present a method to construct real-time systems using as components anytime algorithms whose quality of results degrades gracefully as computation time decreases. Introducing computation time as a degree of freedom defines a scheduling problem involving the activation and interruption of the anytime components. This scheduling problem is especially complicated when trying to construct interruptible algorithms, whose total run-time is unknown in advance. We introduce a framework to measure the performance of anytime algorithms and solve the problem of constructing interruptible algorithms by a mathematical reduction to the problem of constructing contract algorithms, which require the determination of the total run-time when activated. We show how the composition of anytime algorithms can be mechanized as part of a compiler for a LISP-like programming language for real-time systems. The result is a new approach to the construction of complex real-time systems that separates the arrangement of the performance components from the optimization of their scheduling, and automates the latter task.