Sciweavers

1029 search results - page 21 / 206
» Compact representations of ordered sets
Sort
View
TPHOL
2007
IEEE
15 years 8 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
Brigitte Pientka
JMIV
2007
145views more  JMIV 2007»
15 years 2 months ago
Level Lines Selection with Variational Models for Segmentation and Encoding
Abstract. This paper discusses the interest of the Tree of Shapes of an image as a region oriented image representation. The Tree of Shapes offers a compact and structured represen...
Coloma Ballester, Vicent Caselles, Laura Igual, Ll...
EOR
2011
140views more  EOR 2011»
14 years 6 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
15 years 3 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
AI
2008
Springer
15 years 2 months ago
Graphically structured value-function compilation
Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly s...
Ronen I. Brafman, Carmel Domshlak