2355 search results - page 102 / 471 » Scheduling in the Z-Polyhedral Model |
169
click to vote
MOBIHOC
2012
ACM
13 years 8 months ago
2012
ACM
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
156
click to vote
QSHINE
2009
IEEE
16 years 10 days ago
2009
IEEE
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
144
Voted
CPAIOR
2009
Springer
16 years 5 days ago
2009
Springer
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
147
click to vote
EMSOFT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
148
click to vote
GLVLSI
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a novel test scheduling algorithm for embedded corebased SoC’s. Given a system integrated with a set of cores and a set of test resources, we select a test for each c...