497 search results - page 60 / 100 » Approximating max-min linear programs with local algorithms |
LION
2007
Springer
15 years 3 months ago
2007
Springer
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
102
click to vote
MP
2007
14 years 9 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
NIPS
2008
14 years 11 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
AAMAS
2011
Springer
14 years 4 months ago
2011
Springer
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
WOB
2004
14 years 11 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...