Sciweavers

2060 search results - page 210 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
JACM
2007
160views more  JACM 2007»
14 years 10 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
175
Voted
POPL
2005
ACM
15 years 10 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
77
Voted
CEAS
2005
Springer
15 years 3 months ago
Experiences with Greylisting
Greylisting temporarily rejects mail from unknown sources on the theory that real mailers will retry while spamware won’t. I outline a taxonomy of greylisters and report some st...
John R. Levine
98
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 3 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
ATAL
2009
Springer
15 years 4 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson