Sciweavers

989 search results - page 14 / 198
» Version spaces and the consistency problem
Sort
View
IROS
2008
IEEE
122views Robotics» more  IROS 2008»
14 years 2 months ago
A probabilistic Programming by Demonstration framework handling constraints in joint space and task space
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
Sylvain Calinon, Aude Billard
ICRA
2002
IEEE
188views Robotics» more  ICRA 2002»
14 years 20 days ago
Hybrid Mobile Robot Localization using Switching State-Space Models
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...
Haris Baltzakis, Panos E. Trahanias
COMPGEOM
2010
ACM
14 years 2 days ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
AIPS
2010
13 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
IJCAI
2007
13 years 9 months ago
Occam's Razor Just Got Sharper
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
Saher Esmeir, Shaul Markovitch