Sciweavers

9611 search results - page 1760 / 1923
» A Note on Difference Sets
Sort
View
FOCS
2006
IEEE
16 years 16 days ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
GLOBECOM
2006
IEEE
16 years 16 days ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
HPDC
2006
IEEE
16 years 16 days ago
WOW: Self-Organizing Wide Area Overlay Networks of Virtual Workstations
— This paper describes WOW, a distributed system that combines virtual machine, overlay networking and peerto-peer techniques to create scalable wide-area networks of virtual wor...
Arijit Ganguly, Abhishek Agrawal, P. Oscar Boykin,...
ICDCS
2006
IEEE
16 years 16 days ago
Interplay of ISPs: Distributed Resource Allocation and Revenue Maximization
The Internet is a hierarchical architecture comprising heterogeneous entities of privately owned infrastructures, where higher level Internet service providers (ISPs) supply conne...
Sam C. M. Lee, Joe W. J. Jiang, John C. S. Lui, Da...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
16 years 16 days ago
Distributing Google
We consider the problem of wide-area large-scale text search over a peer-to-peer infrastructure. A wide-area search infrastructure with billions of documents and millions of searc...
Vijay Gopalakrishnan, Bobby Bhattacharjee, Peter J...
« Prev « First page 1760 / 1923 Last » Next »