13621 search results - page 29 / 2725 » Computability and Complexity in Self-assembly |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
FUN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
GRID
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...