656 search results - page 92 / 132 » Complexity of finite-horizon Markov decision process problem... |
134
click to vote
AAAI
2006
15 years 3 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
137
Voted
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
The problem of interest is how to dynamically allocate wireless access services in a competitive market which implements a take-it-or-leave-it allocation mechanism. In this paper ...
122
click to vote
ICIC
2005
Springer
15 years 7 months ago
2005
Springer
This paper describes the architecture of a computer system conceived as an intelligent assistant for public transport management. The goal of the system is to help operators of a c...
IBMRD
2006
15 years 1 months ago
2006
The challenge for the development of next generation software is the successful management of the complex computational environment while delivering to the scientist the full powe...
145
click to vote
ICDE
2011
IEEE
14 years 5 months ago
2011
IEEE
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...