1615 search results - page 238 / 323 » Computer science and decision theory |
170
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
175
click to vote
ITP
2010
15 years 4 months ago
2010
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...
165
click to vote
ACSC
2008
IEEE
16 years 25 days ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
217
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
166
click to vote
SIGECOM
2006
ACM
16 years 8 days ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...