Sciweavers

7006 search results - page 220 / 1402
» Approximation Algorithms
Sort
View
ALENEX
2007
158views Algorithms» more  ALENEX 2007»
15 years 4 months ago
Faster Filters for Approximate String Matching
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
Juha Kärkkäinen, Joong Chae Na
SAT
2007
Springer
99views Hardware» more  SAT 2007»
15 years 9 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
15 years 4 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. ...
NIPS
1998
15 years 4 months ago
Fisher Scoring and a Mixture of Modes Approach for Approximate Inference and Learning in Nonlinear State Space Models
We present Monte-Carlo generalized EM equations for learning in nonlinear state space models. The dif
Thomas Briegel, Volker Tresp
ECML
2004
Springer
15 years 8 months ago
Model Approximation for HEXQ Hierarchical Reinforcement Learning
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...
Bernhard Hengst