4126 search results - page 555 / 826 » Set based logic programming |
122
click to vote
DAM
2008
15 years 3 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
142
click to vote
POPL
1998
ACM
15 years 7 months ago
1998
ACM
This paper addresses the problem of how to apply pointer analysis to a wide variety of compiler applications. We are not presenting a new pointer analysis. Rather, we focus on put...
111
click to vote
ISPASS
2006
IEEE
15 years 9 months ago
2006
IEEE
Commercial processors have support for Simultaneous Multithreading (SMT), yet little work has been done to provide representative simulation results for SMT. Given a workload, cur...
123
Voted
PKDD
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
131
Voted
SAS
2005
Springer
15 years 9 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...