Sciweavers

2095 search results - page 331 / 419
» Improved pebbling bounds
Sort
View
PODC
2004
ACM
14 years 3 months ago
On the expected payment of mechanisms for task allocation
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
Artur Czumaj, Amir Ronen
ATAL
2004
Springer
14 years 3 months ago
Product Distribution Theory for Control of Multi-Agent Systems
Product Distribution (PD) theory is a new framework for controlling Multi-Agent Systems (MAS’s). First we review one motivation of PD theory, as the information-theoretic extens...
Chiu Fan Lee, David H. Wolpert
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 3 months ago
Clustering Multidimensional Extended Objects to Speed Up Execution of Spatial Queries
Abstract. We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections...
Cristian-Augustin Saita, François Llirbat
EUROCRYPT
2004
Springer
14 years 3 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
GRID
2004
Springer
14 years 3 months ago
Grid-based Indexing of a Newswire Corpus
In this paper we report experience in the use of computational grids in the domain of natural language processing, particularly in the area of information extraction, to create qu...
Baden Hughes, Srikumar Venugopal, Rajkumar Buyya