Sciweavers

205 search results - page 5 / 41
» On Parameterized Approximability
Sort
View
AUTOMATICA
2010
76views more  AUTOMATICA 2010»
13 years 7 months ago
Approximate dynamic programming with a fuzzy parameterization
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
FCT
2003
Springer
14 years 18 days ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
JDA
2007
73views more  JDA 2007»
13 years 7 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...