Sciweavers

441 search results - page 9 / 89
» Optimal Subsequence Bijection
Sort
View
PR
2007
134views more  PR 2007»
14 years 9 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
IPCO
2007
126views Optimization» more  IPCO 2007»
14 years 11 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
15 years 3 months ago
Robot Trajectory Planning Using Multi-objective Genetic Algorithm Optimization
Generating manipulator trajectories considering multiple objectives and obstacle avoidance is a non trivial optimization problem. In this paper a multiobjective genetic algorithm i...
Eduardo José Solteiro Pires, José An...
IROS
2009
IEEE
155views Robotics» more  IROS 2009»
15 years 4 months ago
Active learning using mean shift optimization for robot grasping
— When children learn to grasp a new object, they often know several possible grasping points from observing a parent’s demonstration and subsequently learn better grasps by tr...
Oliver Kroemer, Renaud Detry, Justus H. Piater, Ja...
100
Voted
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
15 years 1 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers