1095 search results - page 81 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
161
click to vote
ANCS
2008
ACM
15 years 6 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
131
click to vote
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
151
click to vote
EWSN
2004
Springer
16 years 3 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
130
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— Failure-Rate Minimization is becoming one of the major design issues in wireless sensor network (WSN) architecture due to multiple available Functional-units (FUs). There is a ...
130
click to vote
EUC
2007
Springer
15 years 10 months ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...