1483 search results - page 81 / 297 » Geometric constraint satisfaction using optimization methods |
114
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
108
click to vote
KI
2009
Springer
15 years 8 months ago
2009
Springer
Many practical optimization problems are constrained black boxes. Covariance Matrix Adaptation Evolution Strategies (CMA-ES) belong to the most successful black box optimization me...
105
click to vote
AIPS
2010
15 years 3 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
110
Voted
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
140
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...