17 search results - page 1 / 4 » Using Three States for Binary Consensus on Complete Graphs |
60
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
103
Voted
SIROCCO
2010
15 years 2 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
114
Voted
AIPS
2007
15 years 3 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
98
Voted
JAIR
2008
15 years 1 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
126
Voted
JAPLL
2006
15 years 1 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...