109 search results - page 6 / 22 » Algorithm Selection as a Bandit Problem with Unbounded Losse... |
IPSN
2010
Springer
14 years 18 days ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
PPSN
1994
Springer
13 years 9 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
COLT
2004
Springer
13 years 9 months ago
2004
Springer
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
SAC
2005
ACM
13 years 11 months ago
2005
ACM
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...