Sciweavers

337 search results - page 21 / 68
» An Anytime Algorithm for Decision Making under Uncertainty
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Ranking under temporal constraints
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
Lidan Wang, Donald Metzler, Jimmy Lin
ICTAI
2000
IEEE
13 years 11 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
SEMWEB
2007
Springer
14 years 1 months ago
An Ontology-based Bayesian Network Approach for Representing Uncertainty in Clinical Practice Guidelines
Clinical Practice Guidelines (CPGs) play an important role in improving the quality of care and patient outcomes. Although several machine-readable representations of practice guid...
Hai-Tao Zheng, Bo-Yeong Kang, Hong-Gee Kim
SIGIR
2010
ACM
13 years 11 months ago
On statistical analysis and optimization of information retrieval effectiveness metrics
This paper presents a new way of thinking for IR metric optimization. It is argued that the optimal ranking problem should be factorized into two distinct yet interrelated stages:...
Jun Wang, Jianhan Zhu
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...