373 search results - page 30 / 75 » On Deterministic Approximation of DNF |
112
click to vote
DC
2008
14 years 10 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
98
Voted
CCE
2005
14 years 10 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
105
Voted
SPAA
2010
ACM
15 years 3 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...
93
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
JNS
2010
14 years 8 months ago
2010
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...