1380 search results - page 176 / 276 » scheduling 2008 |
94
Voted
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
134
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...
112
Voted
VTC
2008
IEEE
15 years 10 months ago
2008
IEEE
- In this paper, we consider novel cooperative transmission from multiple base stations in multi-user wireless systems. The proposed scheme generates multiple beams using partial c...
154
Voted
FLAIRS
2008
15 years 6 months ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
116
Voted
WSC
2008
15 years 6 months ago
2008
Nowadays container terminals are struggling with a continuously increasing volume. Therefore, they are searching for solutions to increase throughput capacity without expanding th...