176 search results - page 1 / 36 » A Clustering Approach to Solving Large Stochastic Matching P... |
UAI
2001
13 years 8 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
PDCAT
2005
Springer
14 years 28 days ago
2005
Springer
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
IJCAI
2001
13 years 8 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
CCE
2004
13 years 7 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
15 years 2 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...