Sciweavers

44 search results - page 7 / 9
» Approximate inference for planning in stochastic relational ...
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Rectified Linear Units Improve Restricted Boltzmann Machines
Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each binary unit by an infinite number of copies that all ...
Vinod Nair, Geoffrey E. Hinton
INFORMS
1998
150views more  INFORMS 1998»
13 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
ICRA
2007
IEEE
128views Robotics» more  ICRA 2007»
14 years 4 months ago
Adaptive Play Q-Learning with Initial Heuristic Approximation
Abstract— The problem of an effective coordination of multiple autonomous robots is one of the most important tasks of the modern robotics. In turn, it is well known that the lea...
Andriy Burkov, Brahim Chaib-draa
AIED
2011
Springer
13 years 1 months ago
Faster Teaching by POMDP Planning
Both human and automated tutors must infer what a student knows and plan future actions to maximize learning. Though substantial research has been done on tracking and modeling stu...
Anna N. Rafferty, Emma Brunskill, Thomas L. Griffi...
UAI
2008
13 years 11 months ago
Sampling First Order Logical Particles
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
Hannaneh Hajishirzi, Eyal Amir