Sciweavers

2503 search results - page 350 / 501
» A study of 3-arc graphs
Sort
View
SPAA
2010
ACM
15 years 10 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
DSN
2004
IEEE
15 years 9 months ago
Does Your Result Checker Really Check?
A result checker is a program that checks the output of the computation of the observed program for correctness. Introduced originally by Blum, the result checking paradigm has pr...
Lan Guo, Supratik Mukhopadhyay, Bojan Cukic
DIAGRAMS
2006
Springer
15 years 9 months ago
Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 4 months ago
Spectrum Sharing as Spatial Congestion Games
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
Sahand Haji Ali Ahmad, Cem Tekin, Mingyan Liu, Ric...
FSTTCS
2010
Springer
15 years 3 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...