14548 search results - page 407 / 2910 » The Optimal Path-Matching Problem |
218
click to vote
IPCO
2008
15 years 8 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
192
click to vote
NIPS
2004
15 years 8 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
197
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
180
click to vote
NIPS
2003
15 years 8 months ago
2003
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...
171
Voted
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...