844 search results - page 54 / 169 » Solving the p |
DBISP2P
2005
Springer
15 years 3 months ago
2005
Springer
Open peer-to-peer architectures offer many possibilities for replicating database content, but designers have to deal with problems such as peer churn rates and inherent uncertain...
NETGAMES
2004
ACM
15 years 3 months ago
2004
ACM
We propose a fully-distributed peer-to-peer architecture to solve the scalability problem of Networked Virtual Environment in a simple and efficient manner. Our method exploits lo...
ICWE
2004
Springer
15 years 3 months ago
2004
Springer
Lookup of services is an important issues in many distributed systems. This paper deals with lookup in service-oriented architectures, such as Web services, P2P systems, GRIDs, or ...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
SODA
1996
ACM
14 years 11 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...