Sciweavers

4940 search results - page 17 / 988
» On the Complexity of Universal Programs
Sort
View
FLAIRS
2007
13 years 9 months ago
Performance Analysis of Evolutionary Search with a Dynamic Restart Policy
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...
Michael Solano, Istvan Jonyer
JCC
2011
154views more  JCC 2011»
12 years 10 months ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
BMCBI
2008
103views more  BMCBI 2008»
13 years 7 months ago
The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences
Background: Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from ...
Mathieu Fourment, Mark J. Gibbs
CANDC
2005
ACM
13 years 7 months ago
Supporting reflective practice in creativity education
In this study, we design a learning environment to foster participants' creative attitude and evaluate its effectiveness in a university class. Our educational program consis...
Norio Ishii, Kazuhisa Miwa
ALT
2005
Springer
14 years 4 months ago
Monotone Conditional Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
Alexey V. Chernov, Marcus Hutter