486 search results - page 75 / 98 » Improved upper bounds for 3-SAT |
CC
2004
Springer
14 years 1 months ago
2004
Springer
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
ISPAN
1997
IEEE
14 years 20 days ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
GLVLSI
1996
IEEE
14 years 19 days ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
EWCBR
2006
Springer
14 years 4 days ago
2006
Springer
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
ATS
2001
IEEE
14 years 3 days ago
2001
IEEE
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...