Sciweavers

1957 search results - page 63 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ICRA
2006
IEEE
95views Robotics» more  ICRA 2006»
15 years 3 months ago
Discrete Approximations to Continuous Curves
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
Sean B. Andersson
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...
JCP
2007
143views more  JCP 2007»
14 years 9 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
FLAIRS
2009
14 years 7 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
CASES
2010
ACM
14 years 6 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...