5084 search results - page 36 / 1017 » Proving Possibility Properties |
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
MST
2006
13 years 9 months ago
2006
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
WIOPT
2010
IEEE
13 years 8 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...