3874 search results - page 114 / 775 » Approximation Algorithms for k-hurdle Problems |
103
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
ISLPED
2007
ACM
14 years 11 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
PODS
2003
ACM
15 years 10 months ago
2003
ACM
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...