7930 search results - page 592 / 1586 » Greedy in Approximation Algorithms |
216
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
212
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
178
click to vote
ICML
1996
IEEE
16 years 8 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
181
click to vote
ALGORITHMICA
2004
15 years 7 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
282
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...