146 search results - page 14 / 30 » Fault-Tolerant Distributed Theorem Proving |
RSA
2010
13 years 2 months ago
2010
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper investigates extensions of No Free Lunch (NFL) theorems to countably infinite and uncountable infinite domains. The original NFL due to Wolpert and Macready states th...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
FMCO
2008
Springer
13 years 9 months ago
2008
Springer
This paper is placed in the context of large scale distributed programming, providing a programming model based on asynchronous components. It focuses on the semantics of asynchron...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...