20831 search results - page 119 / 4167 » Quantum Computation and Information |
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
SIAMCOMP
1998
13 years 8 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
UAI
2004
13 years 10 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
SIGIR
2003
ACM
14 years 2 months ago
2003
ACM
Following the tradition of these acceptance talks, I will be giving my thoughts on where our field is going. Any discussion of the future of information retrieval (IR) research, h...