217 search results - page 7 / 44 » A New Approach to Abstract Syntax with Variable Binding |
102
click to vote
SAT
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
ESOP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
APLAS
2007
ACM
15 years 3 months ago
2007
ACM
Abstract. We present a formal framework for syntax directed probabilistic program analysis. Our focus is on probabilistic pointer analysis. We show how to obtain probabilistic poin...
102
Voted
TIT
2008
14 years 11 months ago
2008
Abstract--This paper adresses the behavior of the mutual information of correlated multiple-input multiple-output (MIMO) Rayleigh channels when the numbers of transmit and receive ...
AOSD
2008
ACM
15 years 1 months ago
2008
ACM
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...