105 search results - page 7 / 21 » Almost Optimal Solutions to k-Clustering Problems |
IOR
2007
13 years 10 months ago
2007
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
AAAI
2007
14 years 1 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
CPAIOR
2007
Springer
14 years 5 months ago
2007
Springer
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...
AAAI
2004
14 years 8 days ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
CVPR
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we introduce a higher-order MRF optimization
framework. On the one hand, it is very general;
we thus use it to derive a generic optimizer that can be applied
to a...