52 search results - page 8 / 11 » Algebraic fingerprints for faster algorithms |
142
click to vote
GLVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
146
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
159
click to vote
SIGMOD
1995
ACM
15 years 9 months ago
1995
ACM
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
154
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
174
click to vote
COMPGEOM
2001
ACM
15 years 9 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...