989 search results - page 14 / 198 » Version spaces and the consistency problem |
99
Voted
IROS
2008
IEEE
15 years 6 months ago
2008
IEEE
— 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...
101
Voted
ICRA
2002
IEEE
15 years 4 months ago
2002
IEEE
—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...
102
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
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...
117
click to vote
AIPS
2010
15 years 24 days ago
2010
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...
70
Voted
IJCAI
2007
15 years 1 months ago
2007
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...