Sciweavers

1185 search results - page 190 / 237
» The Equivalence of Sampling and Searching
Sort
View
ATAL
2007
Springer
14 years 1 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
14 years 1 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
ICRA
2006
IEEE
183views Robotics» more  ICRA 2006»
14 years 1 months ago
Anytime Dynamic Path-planning with Flexible Probabilistic Roadmaps
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
Khaled Belghith, Froduald Kabanza, Leo Hartman, Ro...
IROS
2006
IEEE
125views Robotics» more  IROS 2006»
14 years 1 months ago
Surface Recognition by Registering Data Curves from Touch
Model-based recognition of an object typically involves matching dense 3D range data. The computational cost is directly affected by the amount of data of which a transformation n...
Rinat Ibrayev, Yan-Bin Jia
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari