106 search results - page 6 / 22 » Probabilistically Checkable Arguments |
AMAI
2002
Springer
13 years 8 months ago
2002
Springer
Probabilistic argumentation systems are based on assumption-based reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of sup...
NETCOOP
2009
Springer
14 years 3 months ago
2009
Springer
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performan...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
SIAMCOMP
1998
13 years 8 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
ISIPTA
2005
IEEE
14 years 2 months ago
2005
IEEE
Logic and probability theory have both a long history in science. They are mainly rooted in philosophy and mathematics, but are nowadays important tools in many other fields such...