14382 search results - page 2524 / 2877 » Time in Connectionist Models |
202
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
170
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
205
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...