Sciweavers

1176 search results - page 133 / 236
» Sparse reward processes
Sort
View
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 10 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
ILP
2007
Springer
15 years 10 months ago
Building Relational World Models for Reinforcement Learning
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...
OZCHI
2006
ACM
15 years 10 months ago
From the certainty of information transfer to the ambiguity of intuition
Handovers between shifts are known causes of preventable adverse events in hospitals. In order to gain an insight into the information transfer that occurs between shifts of senio...
Florian Mueller, Stefanie Kethers, Leila Alem, Ros...
125
Voted
ICAC
2005
IEEE
15 years 10 months ago
Self-Optimizing Architecture for QoS Provisioning in Differentiated Services
This paper presents a scalable and self-optimizing architecture for Quality-of-Service (QoS) provisioning in the Differentiated Services (DiffServ) framework. The proposed archite...
Daniel Yagan, Chen-Khong Tham
ICTAI
2005
IEEE
15 years 10 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze