1554 search results - page 94 / 311 » Parameterized Complexity and Approximation Algorithms |
139
click to vote
NIPS
2008
15 years 4 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
114
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
135
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
106
click to vote
RTSS
2002
IEEE
15 years 8 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
107
click to vote
ICSM
2002
IEEE
15 years 8 months ago
2002
IEEE
We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. B...