Sciweavers

106 search results - page 11 / 22
» Trees with exponentially growing costs
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Value-based observation compression for DEC-POMDPs
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...
Alan Carlin, Shlomo Zilberstein
APPINF
2003
13 years 9 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
DEXA
2008
Springer
87views Database» more  DEXA 2008»
13 years 9 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...
ICML
2005
IEEE
14 years 8 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
CN
2004
148views more  CN 2004»
13 years 7 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...