Sciweavers

531 search results - page 77 / 107
» Using Abstraction for Planning in Sokoban
Sort
View
AAAI
2010
13 years 9 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
IJCAI
1989
13 years 8 months ago
A Computational Framework for Granularity and its Application to Educational Diagnosis
Many artificial intelligence systems implicitly use notions of granularity in reasoning, but there is very little research into granularity itself. An exception is the work of Hob...
Jim E. Greer, Gordon I. McCalla
ATMOS
2007
177views Optimization» more  ATMOS 2007»
13 years 9 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
APIN
1998
107views more  APIN 1998»
13 years 7 months ago
Multiple Adaptive Agents for Tactical Driving
Abstract. Recent research in automated highway systems has ranged from low-level vision-based controllers to high-level route-guidance software. However, there is currently no syst...
Rahul Sukthankar, Shumeet Baluja, John Hancock
DIAGRAMS
2006
Springer
13 years 11 months ago
Flow Diagrams: Rise and Fall of the First Software Engineering Notation
Drawings of water are the earliest, least abstract forms of flow diagram. Representations of ideal or generalised sequences for manufacturing or actual paths for materials between ...
Stephen J. Morris, O. C. Z. Gotel