Sciweavers

22 search results - page 2 / 5
» Combinatorial sketching for finite programs
Sort
View
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 5 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 5 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
KBSE
2010
IEEE
13 years 3 months ago
Eliminating products to test in a software product line
A Software Product Line (SPL) is a family of programs. Testing an SPL is a challenge because the number of programs to examine may be exponential in the number of features. Howeve...
Chang Hwan Peter Kim, Don S. Batory, Sarfraz Khurs...
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 2 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 3 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet