1554 search results - page 70 / 311 » Parameterized Complexity and Approximation Algorithms |
158
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
137
click to vote
DCG
2008
15 years 4 months ago
2008
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
178
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
138
Voted
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
148
Voted
AAIM
2005
Springer
15 years 10 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...