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...
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...
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. ...
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...