Sciweavers

27 search results - page 5 / 6
» Team Programming in Golog under Partial Observability
Sort
View
ISSTA
2007
ACM
13 years 6 months ago
Instrumenting where it hurts: an automatic concurrent debugging technique
As concurrent and distributive applications are becoming more common and debugging such applications is very difficult, practical tools for automatic debugging of concurrent appl...
Rachel Tzoref, Shmuel Ur, Elad Yom-Tov
ATAL
2009
Springer
13 years 11 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
AAAI
2006
13 years 6 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
13 years 6 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
MOBICOM
2010
ACM
13 years 5 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...