Sciweavers

1619 search results - page 62 / 324
» Structure in the Space of Value Functions
Sort
View
NIPS
1990
14 years 11 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
ICDM
2006
IEEE
151views Data Mining» more  ICDM 2006»
15 years 3 months ago
Decision Trees for Functional Variables
Classification problems with functionally structured input variables arise naturally in many applications. In a clinical domain, for example, input variables could include a time...
Suhrid Balakrishnan, David Madigan
JAR
2010
122views more  JAR 2010»
14 years 4 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss
AI
2006
Springer
15 years 1 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar
BMCBI
2006
152views more  BMCBI 2006»
14 years 9 months ago
Predicting deleterious nsSNPs: an analysis of sequence and structural attributes
Background: There has been an explosion in the number of single nucleotide polymorphisms (SNPs) within public databases. In this study we focused on non-synonymous protein coding ...
Richard J. B. Dobson, Patricia B. Munroe, Mark J. ...