Sciweavers

1245 search results - page 5 / 249
» Playing with Conway's problem
Sort
View
TACAS
2007
Springer
91views Algorithms» more  TACAS 2007»
15 years 4 months ago
Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs,
We introduce a novel approach to the smart execution of scenario-based models of reactive systems, such as those resulting from the multi-modal inter-object language of live sequen...
David Harel, Itai Segall
EUROCRYPT
2006
Springer
15 years 1 months ago
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
We show that, in the ideal-cipher model, triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption, thereby resolvin...
Mihir Bellare, Phillip Rogaway
MP
2002
95views more  MP 2002»
14 years 9 months ago
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem....
Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeging...
115
Voted
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
14 years 8 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
15 years 10 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett