477 search results - page 90 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
152
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
116
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
106
click to vote
TSP
2008
15 years 1 months ago
2008
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
151
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...