Sciweavers

536 search results - page 75 / 108
» Planning by Abstraction Using HW[]
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
IJAOSE
2010
227views more  IJAOSE 2010»
13 years 6 months ago
Implementing reactive BDI agents with user-given constraints and objectives
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
Aniruddha Dasgupta, Aditya K. Ghose
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
CBMS
2007
IEEE
14 years 2 months ago
Ontology Engineering to Model Clinical Pathways: Towards the Computerization and Execution of Clinical Pathways
Clinical pathways translate evidence-based recommendations into locally practicable, process-specific algorithms that reduce practice variations and optimize quality of care. Our ...
Katrina F. Hurley, Syed Sibte Raza Abidi