13621 search results - page 369 / 2725 » Computability and Complexity in Self-assembly |
182
click to vote
CMSB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we describe reachability computation for continuous and hybrid systems and its potential contribution to the process of building and debugging biological mo...
166
click to vote
CONPAR
1992
15 years 11 months ago
1992
A major feature of Computer Algebra, and more generally of non-numerical computations, is the dynamical and non-predictable behaviour of the executions. We then understand that st...
179
click to vote
AAAI
1990
15 years 8 months ago
1990
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
166
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
167
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...