Sciweavers

1604 search results - page 84 / 321
» Approximation algorithms for developable surfaces
Sort
View
AAAI
2010
13 years 10 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...
ICASSP
2011
IEEE
13 years 20 days 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
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
13 years 10 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
13 years 6 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
SOFSEM
2009
Springer
14 years 5 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...