962 search results - page 5 / 193 » Near-optimal solutions for the generalized max-controlled se... |
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
HICSS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
JMLR
2010
14 years 4 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
: This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balanc...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...