Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Many websites provide form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we explain the importance of protecting s...
Arjun Dasgupta, Nan Zhang, Gautam Das, Surajit Cha...
As an increasing number of digital library projects embrace the harvesting of item-level descriptive metadata, issues of description granularity and concerns about potential loss ...
Muriel Foulonneau, Timothy W. Cole, Thomas G. Habi...
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...