656 search results - page 26 / 132 » Complexity of finite-horizon Markov decision process problem... |
107
click to vote
JAIR
2008
15 years 1 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
106
click to vote
AIPS
2003
15 years 3 months ago
2003
Recommender systems — systems that suggest to users in e-commerce sites items that might interest them — adopt a static view of the recommendation process and treat it as a pr...
113
click to vote
JAIR
2006
15 years 1 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
121
Voted
SIGMETRICS
2002
ACM
15 years 1 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
103
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...