10988 search results - page 55 / 2198 » Algorithmic Folding Complexity |
BMCBI
2010
13 years 9 months ago
2010
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
GECCO
2000
Springer
14 years 20 days ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
JCSS
2006
13 years 9 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...