13621 search results - page 163 / 2725 » Computability and Complexity in Self-assembly |
210
click to vote
PODS
1994
ACM
15 years 10 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
193
click to vote
TCS
2011
15 years 1 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
245
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
179
click to vote
JFP
2000
15 years 6 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
166
click to vote
JUCS
2010
15 years 4 months ago
2010
: For many complex and dynamic ubiquitous services, context-aware cooperation can be a solution. However, the way is not yet clear to make individual objects cooperate with each ot...