Sciweavers

103 search results - page 7 / 21
» Hedonic clustering games
Sort
View
NETGAMES
2006
ACM
14 years 2 months ago
Load balancing for massively multiplayer online games
Supporting thousands, possibly hundreds of thousands, of players is a requirement that must be satisfied when delivering server based online gaming as a commercial concern. Such a...
Fengyun Lu, Simon E. Parkin, Graham Morgan
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
14 years 2 months ago
Game Theoretic Control for Robot Teams
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ICCCN
2007
IEEE
14 years 2 months ago
Grid Computing on Massively Multi-User Online Platform
—Large-scale online applications such as Massively Multiplayer Online Games (MMOGs) require large amount of computing resources that support many players interacting simultaneous...
Y. C. Allen Yu, Ka Lun Eddie Law
AINA
2005
IEEE
14 years 2 months ago
Scalable Collision Detection for Massively Multiplayer Online Games
We describe approaches for satisfying the real-time collision detection requirements of distributed virtual environments. We assume a distributed virtual environment is deployed u...
Graham Morgan, Kier Storey