1277 search results - page 27 / 256 » Terminating Decision Algorithms Optimally |
130
click to vote
QEST
2008
IEEE
15 years 9 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
129
click to vote
ICANNGA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
119
click to vote
MOR
2007
15 years 2 months ago
2007
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
ICDAR
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents a new technique to improve the combination of classification decisions obtained from local analysis of patterns. Specifically, a genetic algorithm is used to d...
125
click to vote
IAT
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resource...