2168 search results - page 59 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
136
Voted
AGP
1995
IEEE
15 years 7 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
131
Voted
UAI
1998
15 years 4 months ago
1998
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
146
Voted
CEAS
2005
Springer
15 years 5 months ago
2005
Springer
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
146
click to vote
ISSTA
2010
ACM
15 years 5 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
139
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...