Sciweavers

298 search results - page 23 / 60
» Abstract Models of Transfinite Reductions
Sort
View
IJCAI
2003
15 years 1 months ago
Approximating Game-Theoretic Optimal Strategies for Full-scale Poker
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
Darse Billings, Neil Burch, Aaron Davidson, Robert...
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
13 years 7 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes
CP
2005
Springer
15 years 5 months ago
Encoding HTN Planning as a Dynamic CSP
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
Pavel Surynek, Roman Barták
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
15 years 3 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier
FORMATS
2010
Springer
14 years 9 months ago
Simulation and Bisimulation for Probabilistic Timed Automata
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
Jeremy Sproston, Angelo Troina