4894 search results - page 521 / 979 » The Guarding Problem - Complexity and Approximation |
143
click to vote
IJCAI
2007
15 years 6 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
131
click to vote
NIPS
2007
15 years 6 months ago
2007
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
157
Voted
NIPS
2007
15 years 6 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
118
Voted
NIPS
2007
15 years 6 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
122
click to vote
WSC
2004
15 years 6 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...