Sciweavers

936 search results - page 27 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
ECRTS
2008
IEEE
15 years 7 months ago
Period and Deadline Selection for Schedulability in Real-Time Systems
Task period adaptations are often used to alleviate temporal overload conditions in real-time systems. Existing frameworks assume that only task periods are adjustable and that ta...
Thidapat Chantem, Xiaofeng Wang, Michael D. Lemmon...
AHSWN
2010
177views more  AHSWN 2010»
15 years 1 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
15 years 7 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
FORMATS
2004
Springer
15 years 5 months ago
Decomposing Verification of Timed I/O Automata
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
Dilsun Kirli Kaynar, Nancy A. Lynch
COLCOM
2008
IEEE
15 years 7 months ago
Serial vs. Concurrent Scheduling of Transmission and Processing Tasks in Collaborative Systems
In collaboration architectures, a computer must perform both processing and transmission tasks. Intuitively, it seems that these independent tasks should be executed in concurrent ...
Sasa Junuzovic, Prasun Dewan