2479 search results - page 305 / 496 » A Computational Theory of Working Memory |
176
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
196
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...
209
click to vote
DAGSTUHL
2011
14 years 6 months ago
2011
Scientists and engineers are making increasingly use of hp-adaptive discretization methods to compute simulations. While techniques for isocontouring the high-order data generated...
158
click to vote
SMA
2009
ACM
16 years 1 months ago
2009
ACM
Over the last fifty years, there have been numerous efforts to develop from first principles a comprehensive discrete formulation of geometric physics, including Whitney’s ge...
171
click to vote
DRM
2007
Springer
16 years 22 days ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...