1547 search results - page 194 / 310 » Solving Knapsack Problems in a Sticker Based Model |
150
Voted
ICRA
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper proposes a throwing manipulation strategy for a robot with one revolute joint. The throwing manipulation enables the robot not only to manipulate the object to outside o...
130
click to vote
JAL
2006
15 years 3 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
168
click to vote
CVPR
2008
IEEE
15 years 3 months ago
2008
IEEE
We present a novel approach to compute the similarity between two unordered variable-sized vector sets. To solve this problem, several authors have proposed to model each vector s...
126
click to vote
ENTCS
2007
15 years 3 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
103
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
A requirement common to most dynamic vision applications is the ability to track objects in a sequence of frames. This problem has been extensively studied in the past few years, ...