Sciweavers

231 search results - page 5 / 47
» Path disruption games
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 9 months ago
Compound Node-Kayles on Paths
In his celebrated book On Numbers and Games (Academic Press, New-York, 1976), J. H. Conway introduced twelve versions of compound games. We analyze these twelve versions for the N...
Adrien Guignard, Eric Sopena
64
Voted
CHI
2005
ACM
15 years 10 months ago
Behaviour, realism and immersion in games
Immersion is recognised as an important element of good games. However, it is not always clear what is meant by immersion. Earlier work has identified possible barriers to immersi...
Kevin Cheng, Paul A. Cairns
HICSS
2003
IEEE
167views Biometrics» more  HICSS 2003»
15 years 2 months ago
An Adaptive QoS Routing Protocol with Dispersity for Ad-hoc Networks
In this paper, we present the design and simulation of a bandwidth constrained multiple path on-demand routing protocol for ad-hoc networks to support end-to-end Quality of Servic...
Youngki Hwang, Pramod Varshney
INFOCOM
2009
IEEE
15 years 4 months ago
On Leveraging Partial Paths in Partially-Connected Networks
Abstract—Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either ...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...
FSTTCS
2008
Springer
14 years 10 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel