7129 search results - page 374 / 1426 » Approximation Algorithms for Treewidth |
147
Voted
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
147
click to vote
ARITH
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...
171
click to vote
FCS
2006
15 years 6 months ago
2006
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller ...
126
click to vote
IPCO
1996
15 years 6 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
131
click to vote
PAMI
2008
15 years 4 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...