Sciweavers

1185 search results - page 105 / 237
» The Equivalence of Sampling and Searching
Sort
View
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
14 years 1 months ago
Incremental low-discrepancy lattice methods for motion planning
We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the increme...
Stephen R. Lindemann, Steven M. LaValle
ICPR
2000
IEEE
14 years 10 days ago
Comparison between Two Prototype Representation Schemes for a Nearest Neighbor Classifier
2. Character Recognition System The paper is about the problem of finding good prototypes for a condensed nearest neighbor classifiei- in a recognition system. A comparison study ...
Jari Kangas
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
AAAI
1998
13 years 9 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
AAAI
1992
13 years 9 months ago
Reactive Navigation through Rough Terrain: Experimental Results
This paper describes a series of experiments that were performed on the Rocky III robot.1 Rocky III is a small autonomous rover capable of navigating through rough outdoor terrain...
David P. Miller, Rajiv S. Desai, Erann Gat, Robert...