Sciweavers

8512 search results - page 261 / 1703
» Computing Theory With Relevance
Sort
View
158
Voted
CHI
2010
ACM
16 years 1 months ago
Postcolonial computing: a lens on design and development
As our technologies travel to new cultural contexts and our designs and methods engage new constituencies, both our design and analytical practices face significant challenges. We...
Lilly Irani, Janet Vertesi, Paul Dourish, Kavita P...
CCS
2005
ACM
15 years 11 months ago
On the cost-ineffectiveness of redundancy in commercial P2P computing
We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated...
Matthew Yurkewych, Brian Neil Levine, Arnold L. Ro...
152
Voted
DIGRA
2003
Springer
15 years 11 months ago
As if by Magic: On Harry Potter as a Novel and Computer Game
This paper examines the computer game Harry Potter and the Philosopher’s Stone in relation to the novel with the same title. The analysis focuses on the temporal aspects of the ...
Anna Gunder
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 9 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
151
Voted
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
16 years 21 days ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...