Sciweavers

1095 search results - page 12 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 4 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
ICCCN
2007
IEEE
15 years 1 months ago
Fair Efficiency, or Low Average Delay without Starvation
Abstract-- Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit su...
Sergey Gorinsky, Christoph Jechlitschek
TSP
2008
100views more  TSP 2008»
14 years 9 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
MASCOTS
2010
14 years 7 months ago
Efficient Web Requests Scheduling Considering Resources Sharing
Requests scheduling in Web servers is a hot research topic. Many works aim at providing optimal algorithms according to various metrics. Most of these works are based on classical ...
Simon Duquennoy, Gilles Grimaud
JCO
1998
80views more  JCO 1998»
14 years 9 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...