Sciweavers

271 search results - page 21 / 55
» Identifying Optimal Sequential Decisions
Sort
View
AAAI
2006
13 years 11 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
ICML
1998
IEEE
14 years 11 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
ICMLA
2010
13 years 8 months ago
Robust Learning for Adaptive Programs by Leveraging Program Structure
Abstract--We study how to effectively integrate reinforcement learning (RL) and programming languages via adaptation-based programming, where programs can include non-deterministic...
Jervis Pinto, Alan Fern, Tim Bauer, Martin Erwig
EOR
2008
133views more  EOR 2008»
13 years 10 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar
COLT
1994
Springer
14 years 2 months ago
An Optimal Parallel Algorithm for Learning DFA
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
José L. Balcázar, Josep Díaz,...