761 search results - page 14 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
124
click to vote
CCR
2006
15 years 3 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
130
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
TPDS
2008
15 years 2 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
148
click to vote
COCOON
2004
Springer
15 years 6 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
133
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...