Sciweavers

5592 search results - page 455 / 1119
» On Random Betweenness Constraints
Sort
View
NETGAMES
2006
ACM
16 years 23 days ago
Comparing interest management algorithms for massively multiplayer games
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
Jean-Sébastien Boulanger, Jörg Kienzle...
CP
2005
Springer
16 years 10 days ago
Multi-point Constructive Search
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
J. Christopher Beck
EUROCRYPT
2005
Springer
16 years 10 days ago
Predicting and Distinguishing Attacks on RC4 Keystream Generator
In this paper we analyze the statistical distribution of the keystream generator used by the stream ciphers RC4 and RC4A. Our first result is the discovery of statistical biases o...
Itsik Mantin
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
16 years 9 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ICALP
2004
Springer
16 years 6 days ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler