16 search results - page 3 / 4 » On the Width of Semi-Algebraic Proofs and Algorithms |
AIML
2008
14 years 11 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
UAI
2004
14 years 11 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
IROS
2007
IEEE
15 years 3 months ago
2007
IEEE
— We describe decentralized algorithms by which a swarm of simple, independent, autonomous robots can build two-dimensional structures using square building blocks. These structu...
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...
COMPGEOM
1999
ACM
15 years 1 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...