Sciweavers

2374 search results - page 262 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
ATAL
2010
Springer
15 years 4 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
CCR
2007
168views more  CCR 2007»
15 years 2 months ago
Challenges in peer-to-peer gaming
While multi-player online games are very successful, their fast deployment suffers from their server-based architecture. Indeed, servers both limit the scalability of the games a...
Christoph Neumann, Nicolas Prigent, Matteo Varvell...
IPPS
2005
IEEE
15 years 8 months ago
A Powerful Direct Mechanism for Optimal WWW Content Replication
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
Samee Ullah Khan, Ishfaq Ahmad
PVLDB
2010
134views more  PVLDB 2010»
15 years 1 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan