564 search results - page 90 / 113 » Proof General: A Generic Tool for Proof Development |
114
Voted
STOC
1992
ACM
15 years 3 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
SP
2010
IEEE
15 years 3 months ago
2010
IEEE
—A growing number of current web sites combine active content (applications) from untrusted sources, as in so-called mashups. The object-capability model provides an appealing ap...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
102
click to vote
AAAI
1998
15 years 1 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...