Sciweavers

408 search results - page 53 / 82
» Challenges in peer-to-peer gaming
Sort
View
CG
2006
Springer
13 years 11 months ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
PDPTA
2004
13 years 9 months ago
A Framework for Sharing Voluminous Content in P2P Systems
File-sharing applications remain today the most representative and popular realization of the Peerto-Peer paradigm. Large objects receive an increasing amount of interest in such s...
Dimitrios Tsoumakos, Nick Roussopoulos
AFRICACRYPT
2010
Springer
14 years 2 months ago
ECC2K-130 on Cell CPUs
This paper describes an implementation of Pollard’s rho algorithm to compute the elliptic curve discrete logarithm for the Synergistic Processor Elements of the Cell Broadband En...
Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhage...
IAT
2008
IEEE
14 years 2 months ago
Bargaining in Markets with One-Sided Competition: Model and Analysis
The automation of agents that bargain within markets is a challenging open problem. In these settings a seller agent can take advantage from the competition among several buyer ag...
Nicola Gatti
ATAL
2005
Springer
14 years 1 months ago
NETDEMO: openNet networked agents demonstration
One   of   the   most   significant   challenges   in   applying   agent technologies lies in deployment of agent systems in large­scale open   environments.   ...
Steven Willmott, Martin D. Beer, Richard Hill, Dom...