407 search results - page 28 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
192
click to vote
WASA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
105
click to vote
ESA
2006
Springer
15 years 3 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 ...
101
click to vote
JGAA
2000
14 years 11 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...