13621 search results - page 282 / 2725 » Computability and Complexity in Self-assembly |
164
click to vote
SAS
1991
Springer
15 years 10 months ago
1991
Springer
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
178
click to vote
WSC
2004
15 years 8 months ago
2004
This paper discusses an extended adaptive supply network simulation model that explicitly captures growth (in terms of change in size over time, and birth and death) based on Utte...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
172
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
155
click to vote
JC
2008
15 years 6 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...