Sciweavers

1220 search results - page 7 / 244
» Minimal Interval Completions
Sort
View
EOR
2002
79views more  EOR 2002»
13 years 7 months ago
Fast fully polynomial approximation schemes for minimizing completion time variance
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 2 months ago
Completion Time Minimization and Robust Power Control in Wireless Packet Networks
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of al...
Chris T. K. Ng, Muriel Médard, Asuman E. Oz...
JUCS
2006
94views more  JUCS 2006»
13 years 7 months ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe
CISS
2010
IEEE
12 years 11 months ago
Transmission completion time minimization in an energy harvesting system
Abstract—We consider the transmission completion time minimization problem in a single-user energy harvesting wireless communication system. In this system, both the data packets...
Jing Yang, Sennur Ulukus
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
13 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre