5138 search results - page 272 / 1028 » Randomized Algorithms for 3-SAT |
150
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
195
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Diversity and memory are two major mechanisms used in biology to keep the adaptability of organisms in the everchanging environment in nature. These mechanisms can be integrated i...
142
click to vote
TIT
2008
15 years 6 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
165
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
181
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...