Sciweavers

16430 search results - page 51 / 3286
» On Computable Tree Functions
Sort
View
MSCS
2008
110views more  MSCS 2008»
13 years 10 months ago
The Decomposition Tree for analyses of Boolean functions
Maik Friedel, Swetlana Nikolajewa, Thomas Wilhelm
ECML
2006
Springer
14 years 1 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
NAR
2006
156views more  NAR 2006»
13 years 10 months ago
VOMBAT: prediction of transcription factor binding sites using variable order Bayesian trees
Variable order Markov models and variable order Bayesian trees have been proposed for the recognition of transcription factor binding sites, and it could be demonstrated that they...
Jan Grau, Irad E. Ben-Gal, Stefan Posch, Ivo Gross...
JAL
2002
113views more  JAL 2002»
13 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...