Sciweavers

3136 search results - page 333 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
NIPS
1998
15 years 8 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
BMCBI
2006
169views more  BMCBI 2006»
15 years 6 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
BMCBI
2007
128views more  BMCBI 2007»
15 years 6 months ago
A robust and efficient algorithm for the shape description of protein structures and its application in predicting ligand bindin
Background: An accurate description of protein shape derived from protein structure is necessary to establish an understanding of protein-ligand interactions, which in turn will l...
Lei Xie, Philip E. Bourne
JCC
2006
110views more  JCC 2006»
15 years 6 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
182
Voted
BMCBI
2010
105views more  BMCBI 2010»
15 years 6 months ago
Effects of scanning sensitivity and multiple scan algorithms on microarray data quality
Background: Maximizing the utility of DNA microarray data requires optimization of data acquisition through selection of an appropriate scanner setting. To increase the amount of ...
Andrew Williams, Errol M. Thomson