10988 search results - page 115 / 2198 » Algorithmic Folding Complexity |
133
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
105
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
112
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
139
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
114
Voted
GRID
2007
Springer
15 years 8 months ago
2007
Springer
— Replica exchange is a powerful sampling algorithm and can be effectively used for applications such as simulating the structure, function, folding, and dynamics of proteins and...