141 search results - page 6 / 29 » Approximate algorithms for credal networks with binary varia... |
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
ARCS
2004
Springer
14 years 2 months ago
2004
Springer
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
UAI
1998
13 years 10 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
ICC
2009
IEEE
13 years 6 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
Previous work analyzing social networks has mainly focused on binary friendship relations. However, in online social networks the low cost of link formation can lead to networks w...