126 search results - page 16 / 26 » A Global Constraint for Total Weighted Completion Time |
118
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—A new distributed estimation algorithm for tracking using a wireless sensor network is presented. We investigate how to track a time varying signal, noisily sensed by the nodes ...
90
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
106
click to vote
TASE
2008
IEEE
15 years 1 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
102
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
127
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...