7930 search results - page 634 / 1586 » Greedy in Approximation Algorithms |
173
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
164
click to vote
ICCBR
2005
Springer
16 years 22 days ago
2005
Springer
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...
212
click to vote
APPROX
2004
Springer
16 years 19 days ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
147
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
169
click to vote
CP
2008
Springer
15 years 9 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...