502 search results - page 12 / 101 » Monotone Approximation of Decision Problems |
108
Voted
JAIR
2000
15 years 10 days ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
103
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
141
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
110
Voted
ICDT
2005
ACM
15 years 6 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
116
Voted
CORR
2010
Springer
15 years 3 days ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...