Sciweavers

4520 search results - page 184 / 904
» Algebraic Techniques for Timed Systems
Sort
View
CODES
2007
IEEE
16 years 1 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
208
Voted
CONCUR
2006
Springer
15 years 9 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
RTAS
2005
IEEE
16 years 21 days ago
Scheduling Messages with Deadlines in Multi-Hop Real-Time Sensor Networks
Consider a team of robots equipped with sensors that collaborate with one another to achieve a common goal. Sensors on robots produce periodic updates that must be transmitted to ...
Huan Li, Prashant J. Shenoy, Krithi Ramamritham
221
Voted
RTSS
2007
IEEE
16 years 1 months ago
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the general-purpose and embedded system market. The devel...
Marko Bertogna, Michele Cirinei
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
15 years 9 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling