Sciweavers

128 search results - page 14 / 26
» A Complete Bidirectional Planner
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
3DPVT
2004
IEEE
126views Visualization» more  3DPVT 2004»
13 years 11 months ago
Helmholtz Stereopsis on Rough and Strongly Textured Surfaces
Helmholtz Stereopsis (HS) has recently been explored as a promising technique for capturing shape of objects with unknown reflectance. So far, it has been widely applied to object...
Jean-Yves Guillemaut, Ondrej Drbohlav, Radim S&aac...
ACCV
2010
Springer
13 years 2 months ago
Towards Full 3D Helmholtz Stereovision Algorithms
Helmholtz stereovision methods are limited to binocular stereovision or depth maps reconstruction. In this paper, we extend these methods to recover the full 3D shape of the object...
Amaël Delaunoy, Emmanuel Prados, Peter N. Bel...
NETWORKS
2011
13 years 2 months ago
On cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
AGENTS
1998
Springer
13 years 11 months ago
Learning Situation-Dependent Costs: Improving Planning from Probabilistic Robot Execution
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
Karen Zita Haigh, Manuela M. Veloso