Anytime algorithms for ROBDD symmetry detection and approximation
نویسنده
چکیده
vii Acknowledgements viii
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملWidening ROBDDs with Prime Implicants
Despite the ubiquity of ROBDDs in program analysis, and extensive literature on ROBDD minimisation, there is a dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only...
متن کاملTruncated and Anytime Depth-First Branch and Bound: A Case Study on the Asymmetric Traveling Salesman Problem
One of the most applied search algorithms for finding optimal solutions in practice is depthfirst branch and bound (DFBnB), and the most popular method for approximate solutions is local search. Besides the fact that DFBnB is typically applied to obtain optimal solutions, it can also be used to find approximate solutions, and can also run as an anytime algorithm. In this paper, we study DFBnB u...
متن کاملEfficient Feature Group Sequencing for Anytime Linear Prediction
We consider anytime linear prediction in the common machine learning setting, where features are in groups that have costs. We achieve anytime (or interruptible) predictions by sequencing the computation of feature groups and reporting results using the computed features at interruption. We extend Orthogonal Matching Pursuit (OMP) and Forward Regression (FR) to learn the sequencing greedily und...
متن کاملEecient Robdd Operations for Program Analysis
Reduced Ordered Binary Decision Diagrams (ROB-DDs), also known as Bryant graphs, are a representation for Boolean functions supporting many eecient operations. Because of this, they have often been used to implement the positive Boolean functions for program analysis. Some ROBDD operations heavily used in program analysis, however, are still rather expensive. The undertaking of the present pape...
متن کامل