2373 search results - page 389 / 475 » Complexities for generalized models of self-assembly |
158
click to vote
CORR
2008
Springer
15 years 4 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...
142
click to vote
CORR
2008
Springer
15 years 4 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...
117
click to vote
ENTCS
2010
15 years 4 months ago
2010
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
139
click to vote
FGCS
2008
15 years 4 months ago
2008
This paper summarises ongoing research and recent results on the development of flexible access control infrastructure for complex resource provisioning in Grid-based collaborativ...
141
click to vote
DATAMINE
2006
15 years 4 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...