Sciweavers

500 search results - page 19 / 100
» Asynchronous Search with Aggregations
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
SPAA
2003
ACM
14 years 1 months ago
Asynchronous parallel disk sorting
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...
Roman Dementiev, Peter Sanders
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 8 months ago
Privacy preservation of aggregates in hidden databases: why and how?
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...
JCDL
2005
ACM
98views Education» more  JCDL 2005»
14 years 1 months ago
Using collection descriptions to enhance an aggregation of harvested item-level metadata
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...
ADHOCNOW
2009
Springer
14 years 2 months ago
Auction Aggregation Protocols for Wireless Robot-Robot Coordination
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...
Ivan Mezei, Veljko Malbasa, Ivan Stojmenovic