424 search results - page 12 / 85 » Boosted sampling: approximation algorithms for stochastic op... |
CCE
2004
13 years 7 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
SIGMOD
2000
ACM
13 years 12 months ago
2000
ACM
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
ICANN
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Learning algorithms relying on Gibbs sampling based stochastic approximations of the log-likelihood gradient have become a common way to train Restricted Boltzmann Machin...