506 search results - page 85 / 102 » Where Is the Value in a Program Verifier |
118
click to vote
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
108
Voted
RECOMB
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
111
click to vote
SAT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
133
click to vote
ADHOCNOW
2004
Springer
15 years 5 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
ICFP
2005
ACM
16 years 13 days ago
2005
ACM
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...