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...
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 ...
Generating manipulator trajectories considering multiple objectives and obstacle avoidance is a non trivial optimization problem. In this paper a multiobjective genetic algorithm i...
— 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...
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...