In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
With increasing deployment of systems involving multiple coordinating agents, there is a growing need for diagnosing coordination failures in such systems. Previous work presented...
Meir Kalech, Gal A. Kaminka, Amnon Meisels, Yehuda...
Abstract. This paper describes a novel interaction technique to support content-based image search in large image collections. The idea is to represent each image as a vertex in a ...
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...