3820 search results - page 226 / 764 » Bounded Model Debugging |
130
Voted
IJCAI
2007
15 years 4 months ago
2007
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
128
Voted
UAI
2008
15 years 4 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
127
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
CORR
2008
Springer
15 years 3 months ago
2008
Springer
: Given R groups of numerical variables X1, ... XR, we assume that each group is the result of one underlying latent variable, and that all latent variables are bound together thro...
139
click to vote
CIE
2005
Springer
15 years 9 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...