7006 search results - page 174 / 1402 » Approximation Algorithms |
133
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to co...
187
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
117
click to vote
ALENEX
2004
15 years 4 months ago
2004
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
109
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
137
click to vote
WG
2007
Springer
15 years 9 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...