Sciweavers

8413 search results - page 35 / 1683
» Ordering Problem Subgoals
Sort
View
ICRA
2002
IEEE
223views Robotics» more  ICRA 2002»
14 years 26 days ago
Dynamic Motion Planning Whole Arm Grasp Systems Based on Switching Contact Modes
We present motion planning for dexterous manipulation by whole arm grasp system based on switching contact modes. Motion planning for such a system should consider changing dynami...
Masahito Yashima, Hideya Yamaguchi
AAAI
2000
13 years 9 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
EUROCRYPT
2010
Springer
14 years 22 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
ICML
2003
IEEE
14 years 8 months ago
Weighted Order Statistic Classifiers with Large Rank-Order Margin
We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifie...
Reid B. Porter, Damian Eads, Don R. Hush, James Th...
IJCAI
2001
13 years 9 months ago
Total-Order Planning with Partially Ordered Subtasks
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
Dana S. Nau, Héctor Muñoz-Avila, Yue...