Sciweavers

685 search results - page 4 / 137
» Succinct Trees in Practice
Sort
View
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
14 years 25 days ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
LATIN
2010
Springer
14 years 2 months ago
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
Johannes Fischer
AAAI
2007
13 years 9 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
14 years 1 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
CN
2004
114views more  CN 2004»
13 years 7 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford