Sciweavers

2648 search results - page 85 / 530
» Challenges for Network Computer Games
Sort
View
ICPR
2010
IEEE
13 years 8 months ago
Robust Figure Extraction on Textured Background: A Game-Theoretic Approach
Feature-based image matching relies on the assumption that the features contained in the model are distinctive enough. When both model and data present a sizeable amount of clutte...
Andrea Albarelli, Emanuele Rodolà, Alberto Cavall...
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
14 years 3 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
PLDI
2005
ACM
14 years 2 months ago
Programming ad-hoc networks of mobile and resource-constrained devices
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...
Yang Ni, Ulrich Kremer, Adrian Stere, Liviu Iftode
ICDE
2009
IEEE
121views Database» more  ICDE 2009»
14 years 4 months ago
Scalability for Virtual Worlds
— Networked virtual environments (net-VEs) are the next wave of digital entertainment, with Massively Multiplayer Online Games (MMOs) a very popular instance. Current MMO archite...
Nitin Gupta 0003, Alan J. Demers, Johannes Gehrke,...
ACMACE
2009
ACM
14 years 1 months ago
Familiars: representing Facebook users' social behaviour through a reflective playful experience
In this paper, we describe the design and development of a social game called Familiars. Inspired by the daemons in Pullman’s “Dark Material” trilogy, Familiars are animal c...
Ben Kirman, Eva Ferrari, Shaun Lawson, Jonathan Fr...