Sciweavers

2648 search results - page 214 / 530
» Challenges for Network Computer Games
Sort
View
113
Voted
BROADNETS
2007
IEEE
15 years 10 months ago
IP fast rerouting for single-link/node failure recovery
—Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and reso...
Kang Xi, H. Jonathan Chao
148
Voted
DBSK
2007
98views more  DBSK 2007»
15 years 3 months ago
MTrainSchedule: Combining Web Services and Data Caching on Mobile Devices
Abstract. Despite recent improvements in wireless network protocols and the manufacturing of better, more performant mobile devices, developing mobile applications and services sti...
Iulia Ion, Alexandru Caracas, Hagen Höpfner
120
Voted
ICDCS
1991
IEEE
15 years 7 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
144
Voted
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 3 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
145
Voted
NETGAMES
2003
ACM
15 years 8 months ago
Spatial principles of level-design in multi-player first-person shooters
: This paper outlines the basic spatial principles of level design in multi-player first-person shooters with special reference to Counterstrike, basing itself on experiment, analy...
Christian Güttler, Troels Degn Johansson