2924 search results - page 355 / 585 » Lower Bounds in Distributed Computing |
151
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
144
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
152
click to vote
CPC
2007
15 years 4 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
128
click to vote
JSAC
2008
15 years 4 months ago
2008
We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
139
click to vote
ANOR
2005
15 years 4 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...