Sciweavers

466 search results - page 26 / 94
» A Theory of Rate-Based Execution
Sort
View
ICDCS
2006
IEEE
15 years 3 months ago
On Scheduling Expansive and Reductive Dags for Internet-Based Computing
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Ros...
AAAI
1998
14 years 11 months ago
Supermodels and Robustness
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Ro...
AI
1998
Springer
14 years 9 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque
RTS
2002
177views more  RTS 2002»
14 years 9 months ago
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms
This paper presents a Feedback Control real-time Scheduling (FCS) framework for adaptive realtime systems. An advantage of the FCS framework is its use of feedback control theory ...
Chenyang Lu, John A. Stankovic, Sang Hyuk Son, Gan...
WER
2010
Springer
14 years 7 months ago
From User Requirements to Tasks Descriptions in Real-Time Systems
Real-time scheduling theory has made a great progress in the last decades. From small devices to enormous satellites or industrial plants take advantage of this ongoing research. H...
Leo Ordínez, David Donari, Rodrigo M. Santo...