Sciweavers

2322 search results - page 88 / 465
» On a game in directed graphs
Sort
View
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
16 years 6 days ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
CORR
2008
Springer
174views Education» more  CORR 2008»
15 years 6 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
MHCI
2009
Springer
16 years 25 days ago
Poker surface: combining a multi-touch table and mobile phones in interactive card games
In this paper, we introduce the design and implementation of a digital card game that combines mobile phone gestures and multitouch tabletop interactions. Conceptually based on in...
Alireza Sahami Shirazi, Tanja Döring, Pouyan ...
AAAI
2000
15 years 7 months ago
Human-Level AI's Killer Application: Interactive Computer Games
Although one of the fundamental goals of AI is to understand and develop intelligent systems that have all of the capabilities of humans, there is little active research directly ...
John E. Laird, Michael van Lent
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 7 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...