1603 search results - page 50 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
161
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
159
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
158
click to vote
HICSS
2005
IEEE
15 years 11 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...
169
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
153
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...