Sciweavers

5084 search results - page 427 / 1017
» Proving Possibility Properties
Sort
View
ICLP
2009
Springer
16 years 7 months ago
Answer Set Programming for Single-Player Games in General Game Playing
As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human...
Michael Thielscher
ESORICS
2009
Springer
16 years 7 months ago
The Wisdom of Crowds: Attacks and Optimal Constructions
We present a traffic analysis of the ADU anonymity scheme presented at ESORICS 2008, and the related RADU scheme. We show that optimal attacks are able to de-anonymize messages mor...
Carmela Troncoso, Claudia Díaz, Emilia K&au...
CADE
2007
Springer
16 years 7 months ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 7 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
STOC
2005
ACM
146views Algorithms» more  STOC 2005»
16 years 7 months ago
Approximation algorithms for combinatorial auctions with complement-free bidders
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
Shahar Dobzinski, Noam Nisan, Michael Schapira