160
click to vote
CC
2012
Springer
13 years 8 months ago
2012
Springer
Pointer analysis is one of the most important static analyses during compilation. While several enhancements have been made to scale pointer analysis, the work on parallelizing the...
110
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
86
Voted
ISSS
1997
IEEE
15 years 5 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
111
Voted
AI
2003
Springer
15 years 6 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
101
Voted
IEEEPACT
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
106
Voted
ICCD
2004
IEEE
15 years 9 months ago
2004
IEEE
ACG (Adjacent Constraint Graph) is invented as a general floorplan representation. It has advantages of both adjacency graph and constraint graph of a floorplan: edges in an ACG...
83
Voted
HPCA
2008
IEEE
16 years 1 months ago
2008
IEEE
