1930 search results - page 362 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
JAIR
2010
13 years 7 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
CEC
2010
IEEE
13 years 3 days ago
2010
IEEE
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
—A methodology is presented for integrating effective-bandwidth-based routing for QoS-sensitive traffic and datagram routing of the best-effort traffic. To prevent excessive dela...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
LCTRTS
2001
Springer
14 years 28 days ago
2001
Springer
1 COTS (commercial off-the-shelf) devices are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices...