1380 search results - page 176 / 276 » scheduling 2008 |
124
click to vote
DATE
2008
IEEE
16 years 17 days 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...
163
click to vote
INFOCOM
2008
IEEE
16 years 15 days 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...
151
click to vote
VTC
2008
IEEE
16 years 14 days 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...
188
click to vote
FLAIRS
2008
15 years 8 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...
138
click to vote
WSC
2008
15 years 8 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...