1816 search results - page 57 / 364 » A New Approach for Solving the Maximum Clique Problem |
145
Voted
TRANSCI
2010
15 years 17 days ago
2010
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
159
click to vote
EVOW
2005
Springer
15 years 11 months ago
2005
Springer
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
159
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Estimating a camera pose given a set of 3D-object and 2Dimage feature points is a well understood problem when correspondences are given. However, when such correspondenc...
161
click to vote
EVOW
2009
Springer
16 years 20 days ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
156
Voted
CP
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...