Sciweavers

7129 search results - page 245 / 1426
» Approximation Algorithms for Treewidth
Sort
View
AAAI
2010
15 years 5 months ago
Reinforcement Learning via AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
151
Voted
DAM
2006
191views more  DAM 2006»
15 years 4 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
ICASSP
2011
IEEE
14 years 7 months ago
Closed-form approximation of linear phase IIR digital filters with guaranteed stability
We develop a closed-form approximation algorithm for designing IIR digital filters with linear phase and guaranteed stability. In this algorithm, the stopband and passband edge f...
Masayoshi Nakamoto, Shuichi Ohno
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 4 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
149
Voted
AGI
2008
15 years 5 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov