747 search results - page 46 / 150 » Theory and Construction of Molecular Computers |
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
IJFCS
2006
13 years 8 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
DIGRA
2003
Springer
14 years 1 months ago
2003
Springer
Communication between players in networked computer games is often inadequately implemented. The games do not exploit the full potential of using different forms of communication ...