Sciweavers

547 search results - page 24 / 110
» A Planning Algorithm not based on Directional Search
Sort
View
W2GIS
2004
Springer
14 years 1 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
SIGIR
2008
ACM
13 years 7 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
PG
2000
IEEE
14 years 4 days ago
Interactive Manipulation Planning for Animated Characters
We present a brief overview of an algorithm for interactively animating object grasping and manipulation tasks for human figures. The technique is designed to efficiently genera...
James J. Kuffner Jr., Jean-Claude Latombe
IROS
2009
IEEE
154views Robotics» more  IROS 2009»
14 years 2 months ago
Graph signature for self-reconfiguration planning of modules with symmetry
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
Masoud Asadpour, Mohammad Hassan Zokaei Ashtiani, ...
CW
2002
IEEE
14 years 22 days ago
Direct Segmentation for Reverse Engineering
In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate co...
Marek Vanco, Guido Brunnett