1277 search results - page 71 / 256 » Terminating Decision Algorithms Optimally |
115
click to vote
CRV
2009
IEEE
15 years 10 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
152
click to vote
IEEEARES
2006
IEEE
15 years 9 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
118
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
147
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
148
click to vote
SAGA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...