Sciweavers

178 search results - page 19 / 36
» Can Proofs Be Animated By Games
Sort
View
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
14 years 4 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
FOCS
2008
IEEE
14 years 2 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
ENTCS
2006
138views more  ENTCS 2006»
13 years 7 months ago
Propositional Games with Explicit Strategies
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
Bryan Renne
CHI
2009
ACM
14 years 2 months ago
Growing up programming: democratizing the creation of dynamic, interactive media
Young people interact with games, animations, and simulations all of the time. But few of them are able to create interactive media. The obstacle: traditional programming language...
Mitchel Resnick, Mary Flanagan, Caitlin Kelleher, ...
PG
2007
IEEE
14 years 1 months ago
Wrestle Alone : Creating Tangled Motions of Multiple Avatars from Individually Captured Motions
Animations of two avatars tangled with each other often appear in battle or fighting scenes in movies or games. However, creating such scenes is difficult due to the limitations...
Edmond S. L. Ho, Taku Komura