2924 search results - page 193 / 585 » Lower Bounds in Distributed Computing |
119
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
123
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
129
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
129
click to vote
SIROCCO
2000
15 years 4 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
154
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...