13752 search results - page 2495 / 2751 » Parallel and Distributed Haskells |
124
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
122
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
108
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
125
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
122
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...