1940 search results - page 230 / 388 » Graph Transformation with Variables |
134
click to vote
SLS
2009
Springer
15 years 10 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
178
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
144
click to vote
GLVLSI
2002
IEEE
15 years 9 months ago
2002
IEEE
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
152
click to vote
OOPSLA
1999
Springer
15 years 8 months ago
1999
Springer
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...
132
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...