Sciweavers

1930 search results - page 380 / 386
» Learning to Solve QBF
Sort
View
EOR
2006
148views more  EOR 2006»
13 years 7 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
BMCBI
2007
145views more  BMCBI 2007»
13 years 7 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
BMCBI
2007
93views more  BMCBI 2007»
13 years 7 months ago
SVM-Fold: a tool for discriminative multi-class protein fold and superfamily recognition
Background: Predicting a protein’s structural class from its amino acid sequence is a fundamental problem in computational biology. Much recent work has focused on developing ne...
Iain Melvin, Eugene Ie, Rui Kuang, Jason Weston, W...
JMLR
2008
129views more  JMLR 2008»
13 years 7 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos