Sciweavers

108 search results - page 12 / 22
» Computational Methods for Oblivious Equilibrium
Sort
View
SIROCCO
2008
14 years 11 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
ICDCS
1998
IEEE
15 years 1 months ago
Structuring Remote Object Systems for Mobile Hosts with Intermittent Connectivity
In distributed object systems, remote method inattempts to abstract communication between di erent machines to the level of object method invocation. Link failure in such systems ...
Girish Welling, Maximilian Ott
68
Voted
SIGCOMM
2010
ACM
14 years 9 months ago
ASTUTE: detecting a different class of traffic anomalies
When many flows are multiplexed on a non-saturated link, their volume changes over short timescales tend to cancel each other out, making the average change across flows close to ...
Fernando Silveira, Christophe Diot, Nina Taft, Ram...
JSAC
2008
140views more  JSAC 2008»
14 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
CGF
2008
184views more  CGF 2008»
14 years 9 months ago
GPU Accelerated Direct Volume Rendering on an Interactive Light Field Display
We present a GPU accelerated volume ray casting system interactively driving a multi-user light field display. The display, driven by a single programmable GPU, is based on a spec...
Marco Agus, Enrico Gobbetti, José Antonio I...