Sciweavers

2299 search results - page 381 / 460
» Inference and Learning in Planning
Sort
View
UAI
2003
15 years 5 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
CORR
2010
Springer
177views Education» more  CORR 2010»
15 years 4 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 4 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
ICRA
2008
IEEE
471views Robotics» more  ICRA 2008»
15 years 10 months ago
Autonomous image-based exploration for mobile robot navigation
— Image-based navigation paradigms have recently emerged as an interesting alternative to conventional modelbased methods in mobile robotics. In this paper, we augment the existi...
D. Santosh, Supreeth Achar, C. V. Jawahar
IRI
2008
IEEE
15 years 10 months ago
Computation with imprecise probabilities
abstract An imprecise probability distribution is an instance of second-order uncertainty, that is, uncertainty about uncertainty, or uncertainty for short. Another instance is an ...
Lotfi A. Zadeh