874 search results - page 125 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—We present an optimal methodology for dynamic voltage scheduling problem in the presence of realistic assumption such as leakage-power and intra-task overheads. Our contribution...
IAT
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
IJFCS
2006
14 years 9 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...