1483 search results - page 68 / 297 » Geometric constraint satisfaction using optimization methods |
121
click to vote
IROS
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract— Mobile robots need maps or other forms of geometric information about the environment to navigate. The mobility sensors (LADAR, stereo, etc.) on these robotic vehicles ...
118
click to vote
SODA
2000
ACM
15 years 2 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
114
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper, we present a non-rigid quasi-dense matching method and its application to object recognition and segmentation. The matching method is based on the match propagation...
117
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
475
click to vote
Presentation
In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on Genetic Algorithm (GA). This...