5608 search results - page 295 / 1122 » On the Theory of Matchgate Computations |
175
click to vote
DIGRA
2003
Springer
15 years 12 months ago
2003
Springer
This essay adopts a formal model of play as semiosis [18] to explore the often dysfunctional role of backstories within computer game design and play. Within this model, backstori...
202
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
185
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
217
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
As cloud computing environments become explosively popular, dealing with unpredictable changes, uncertainties, and disturbances in both systems and environments turns out to be on...
240
click to vote
Lecture Notes
These lecture notes cover several topics such as Optimization, Technology and profit maximization, Profit maximization and cost minimization, The cost function & duality, Consu...