Sciweavers

16430 search results - page 930 / 3286
» On Computable Tree Functions
Sort
View
BMCBI
2007
95views more  BMCBI 2007»
15 years 7 months ago
ZPS: visualization of recent adaptive evolution of proteins
Background: Detection of adaptive amino acid changes in proteins under recent short-term selection is of great interest for researchers studying microevolutionary processes in mic...
Sujay Chattopadhyay, Daniel E. Dykhuizen, Evgeni V...
ICML
2005
IEEE
16 years 8 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
CADE
2005
Springer
16 years 8 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 8 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein

Publication
404views
16 years 4 months ago
Bayesian variable order Markov models.
We present a simple, effective generalisation of variable order Markov models to full online Bayesian estimation. The mechanism used is close to that employed in context tree wei...
Christos Dimitrakakis