Sciweavers

119 search results - page 4 / 24
» An analysis of massively distributed evolutionary algorithms
Sort
View
ICCNMC
2005
Springer
13 years 12 months ago
On Mitigating Network Partitioning in Peer-to-Peer Massively Multiplayer Games
Recently, peer-to-peer infrastructure has been proposed to support massively multiplayer games in the literature. However, when underlying network partitions due to network outages...
Yuan He, Yi Zhang, Jiang Guo
IPPS
2008
IEEE
14 years 22 days ago
Massive supercomputing coping with heterogeneity of modern accelerators
Heterogeneous supercomputers with combined general purpose and accelerated CPUs promise to be the future major architecture due to their wideranging generality and superior perfor...
Toshio Endo, Satoshi Matsuoka
VLDB
2005
ACM
177views Database» more  VLDB 2005»
13 years 11 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
ATAL
2009
Springer
14 years 27 days ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
13 years 11 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...