Sciweavers

258 search results - page 15 / 52
» A General Model for Online Probabilistic Plan Recognition
Sort
View
ICANN
2010
Springer
13 years 7 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora
IJCAI
2007
13 years 9 months ago
Online Learning and Exploiting Relational Models in Reinforcement Learning
In recent years, there has been a growing interest in using rich representations such as relational languages for reinforcement learning. However, while expressive languages have ...
Tom Croonenborghs, Jan Ramon, Hendrik Blockeel, Ma...
ICML
2010
IEEE
13 years 7 months ago
FAB-MAP: Appearance-Based Place Recognition and Mapping using a Learned Visual Vocabulary Model
We present an overview of FAB-MAP, an algorithm for place recognition and mapping developed for infrastructure-free mobile robot navigation in large environments. The system allow...
Mark Joseph Cummins, Paul M. Newman
ICDAR
2009
IEEE
13 years 5 months ago
Finding the Most Probable Ranking of Objects with Probabilistic Pairwise Preferences
This paper discusses the ranking of a set of objects when a possibly inconsistent set of pairwise preferences is given. We consider the task of ranking objects when pairwise prefe...
Mikhail Parakhin, Patrick M. Haluptzok
AIPS
2008
13 years 10 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan