Sciweavers

60 search results - page 1 / 12
» Finding Relations Among Linear Constraints
Sort
View
AISC
2006
Springer
13 years 9 months ago
Finding Relations Among Linear Constraints
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
Jun Yan, Jian Zhang, Zhongxing Xu
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 5 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
IJCAI
2001
13 years 6 months ago
The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satis...
Luc De Raedt, Stefan Kramer
CSCLP
2007
Springer
13 years 11 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
SAS
2004
Springer
136views Formal Methods» more  SAS 2004»
13 years 10 months ago
Constraint-Based Linear-Relations Analysis
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Man...