Sciweavers

5153 search results - page 267 / 1031
» Introduction to Randomized Algorithms
Sort
View
NETGAMES
2006
ACM
16 years 19 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...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
16 years 24 days ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
TCS
2010
15 years 5 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel
CORR
2011
Springer
148views Education» more  CORR 2011»
15 years 1 months ago
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
Stefan Kiefer, Andrzej S. Murawski, Joël Ouak...
AINA
2007
IEEE
16 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein