7 search results - page 2 / 2 » Approximability and parameterized complexity of minmax value... |
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
JMLR
2010
13 years 2 days ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...