Sciweavers

641 search results - page 32 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
COLT
1999
Springer
15 years 1 months ago
Drifting Games
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
Robert E. Schapire
67
Voted
ECAI
2006
Springer
15 years 1 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
BMCBI
2007
96views more  BMCBI 2007»
14 years 9 months ago
Features generated for computational splice-site prediction correspond to functional elements
Background: Accurate selection of splice sites during the splicing of precursors to messenger RNA requires both relatively well-characterized signals at the splice sites and auxil...
Rezarta Islamaj Dogan, Lise Getoor, W. John Wilbur...
BMCBI
2006
198views more  BMCBI 2006»
14 years 9 months ago
Gene selection and classification of microarray data using random forest
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
Ramón Díaz-Uriarte, Sara Alvarez de ...
COR
2006
122views more  COR 2006»
14 years 9 months ago
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, ...