Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
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...
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...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
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 ...
Walid Hachem, Oleksiy Khorunzhiy, Philippe Loubato...
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...