1277 search results - page 143 / 256 » Terminating Decision Algorithms Optimally |
125
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
138
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
118
Voted
CN
2004
15 years 3 months ago
2004
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
170
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
136
click to vote
AAAI
2007
15 years 5 months ago
2007
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...