Sciweavers

348 search results - page 39 / 70
» Event tree based sampling
Sort
View
AIPS
2009
14 years 11 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
ICPR
2006
IEEE
15 years 11 months ago
Fast Support Vector Machine Classification using linear SVMs
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
Karina Zapien Arreola, Janis Fehr, Hans Burkhardt
IROS
2009
IEEE
111views Robotics» more  IROS 2009»
15 years 4 months ago
An exploration method for general robotic systems equipped with multiple sensors
Abstract— This paper presents a novel method for sensorbased exploration of unknown environments by a general robotic system equipped with multiple sensors. The method is based o...
Luigi Freda, Giuseppe Oriolo, Francesco Vecchioli
ILP
2004
Springer
15 years 3 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
AAAI
1998
14 years 11 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