253 search results - page 35 / 51 » Conditional Symmetry Breaking |
STOC
2002
ACM
16 years 2 days ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
108
click to vote
PODC
2006
ACM
15 years 5 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
101
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
119
click to vote
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...