982 search results - page 115 / 197 » Solving Steiner tree problems in graphs to optimality |
111
Voted
AIPS
2010
15 years 3 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
136
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate prope...
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
123
click to vote
PAMI
2006
15 years 16 days ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
119
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...