1603 search results - page 146 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
165
click to vote
AAMAS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We study optimal control in large stochastic multi-agent systems in continuous space and time. We consider multi-agent systems where agents have independent dynamics with...
179
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
158
click to vote
COR
2006
15 years 6 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
141
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We discuss the problem of clustering elements according to the sources that have generated them. For elements that are characterized by independent binary attributes, a closedform...
143
click to vote
JISE
2006
15 years 6 months ago
2006
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...