1040 search results - page 97 / 208 » Rounding algorithms for covering problems |
111
click to vote
PODC
2011
ACM
14 years 21 days ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
ACMICEC
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
AUTOMATICA
2006
14 years 10 months ago
2006
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...