365 search results - page 42 / 73 » Solving the Multiplication Constraint in Several Approximati... |
118
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— We present a novel approach to build approximate maps of structured environments utilizing human motion and activity. Our approach uses data recorded with a data suit which is ...
142
click to vote
IJCAI
2007
15 years 7 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
156
click to vote
AIIA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
143
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
145
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We introduce locally-rigid motion, a general framework for solving the M-point, N-view structure-from-motion problem for unknown bodies deforming under orthography. The key idea i...