This paper describes a technique for calculating the switching activity of a set of registers shared by dierent data values. Based on the assumption that the joint pdf (probabili...
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....