Sciweavers

592 search results - page 13 / 119
» Learning Generalized Plans Using Abstract Counting
Sort
View
TNN
2010
143views Management» more  TNN 2010»
13 years 3 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
ML
2008
ACM
100views Machine Learning» more  ML 2008»
13 years 8 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
14 years 2 months ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle
AIPS
1996
13 years 9 months ago
Deduction-Based Refinement Planning
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
Werner Stephan, Susanne Biundo
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
14 years 2 months ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...