Design-to-time scheduling and anytime algorithms

Authors:
Alan Garvey;Victor Lesser
Affiliations:
-;-
Venue:
ACM SIGART Bulletin
Year:
1996

Citing 3
Cited 3

Operational rationality through compilation of anytime algorithms

Operational rationality through compilation of anytime algorithms
Design-to-time real-time scheduling

Design-to-time real-time scheduling
Design-to-time Scheduling with Uncertainty

Design-to-time Scheduling with Uncertainty

Cashing in on Caching: An Architecture for Time-BoundedKnowledge-Based Problem Solving

Real-Time Systems
Evolution of the GPGP/TÆMS Domain-Independent Coordination Framework

Autonomous Agents and Multi-Agent Systems
Adaptive parameter control of evolutionary algorithms to improve quality-time trade-off

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Design-to-time real-time scheduling is an approach to solving time-sensitive problems where multiple methods are available for many subproblems. It is an alternative to the anytime algorithm approach, scheduling discrete methods rather than anytime algorithms with the goal of maximizing the value of the scheduled computation. In this paper we briefly introduce the design-to-time approach, describe how design-to-time can be used to schedule anytime algorithms including some experimental results, and examine anytime characteristics of our design-to-time scheduling algorithm.