Sciweavers

Share
521 search results - page 1 / 105
» Reduction Strategies and Acyclicity
Sort
View
BIRTHDAY
2007
Springer
12 years 9 months ago
Reduction Strategies and Acyclicity
Abstract. In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, coļ¬nal, Church-Rosser. A stumbling block in the...
Jan Willem Klop, Vincent van Oostrom, Femke van Ra...
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
11 years 3 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
CORR
2010
Springer
132views Education» more  CORR 2010»
12 years 3 months ago
Acyclic Solos and Differential Interaction Nets
We present a restriction of the solos calculus which is stable under reduction and expressive enough to contain an encoding of the pi-calculus. As a consequence, it is shown that ...
Thomas Ehrhard, Olivier Laurent
NETWORKS
2008
12 years 3 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
CORR
2010
Springer
76views Education» more  CORR 2010»
12 years 3 months ago
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
Jeroen Ketema, Jakob Grue Simonsen
books