Sciweavers

3934 search results - page 21 / 787
» Approximate Schedulability Analysis
Sort
View
ICCBR
2007
Springer
14 years 3 months ago
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
Thomas Gabel, Martin Riedmiller
DATE
2009
IEEE
249views Hardware» more  DATE 2009»
14 years 4 months ago
White box performance analysis considering static non-preemptive software scheduling
—In this paper, a novel approach for integrating static non-preemptive software scheduling in formal bottom-up performance evaluation of embedded system models is described. The ...
Alexander Viehl, Michael Pressler, Oliver Bringman...
RTCSA
2008
IEEE
14 years 4 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
RTSS
2007
IEEE
14 years 4 months ago
Real-Time Query Scheduling for Wireless Sensor Networks
Recent years have seen the emergence of wireless sensor network systems that must support high data rate and realtime queries of physical environments. This paper proposes Real-Ti...
Octav Chipara, Chenyang Lu, Gruia-Catalin Roman
ORL
2008
112views more  ORL 2008»
13 years 9 months ago
A monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
Sven Oliver Krumke, Anne Schwahn, Rob van Stee, St...