1277 search results - page 29 / 256 » Terminating Decision Algorithms Optimally |
112
click to vote
MP
2006
15 years 2 months ago
2006
We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time o...
149
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
130
click to vote
PPSN
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
119
click to vote
ICML
2001
IEEE
16 years 3 months ago
2001
IEEE
This paper examines the notion of symmetry in Markov decision processes (MDPs). We define symmetry for an MDP and show how it can be exploited for more effective learning in singl...
119
click to vote
ICML
1995
IEEE
16 years 3 months ago
1995
IEEE
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...