17 search results - page 1 / 4 » Using Three States for Binary Consensus on Complete Graphs |
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
SIROCCO
2010
13 years 6 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...
AIPS
2007
13 years 7 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...
JAIR
2008
13 years 4 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...
JAPLL
2006
13 years 4 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...