10051 search results - page 379 / 2011 » A Dynamic Separator Algorithm |
196
click to vote
LCTRTS
1995
Springer
15 years 11 months ago
1995
Springer
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
223
click to vote
INFOCOM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—We consider the power control problem in a timeslotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel betwee...
225
click to vote
IMCSIT
2010
15 years 5 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
199
Voted
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
180
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that ...