816 search results - page 30 / 164 » Abstract Barycentric Algebras |
SAC
2009
ACM
14 years 2 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Opportunistic routing (OR) has received much attention as a new routing paradigm due to its efficient utilization of broadcasting and spacial diversity of the wireless ...
ENTCS
2008
13 years 7 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...