5804 search results - page 822 / 1161 » Doing more with less |
253
click to vote
OOPSLA
2000
Springer
15 years 10 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
168
click to vote
PPDP
2000
Springer
15 years 10 months ago
2000
Springer
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
157
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
150
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
Most existing high-level synthesis(HLS) systems attempt to generate a circuit from a behavioral description \out of the void", using the entire design space as the search dom...
183
click to vote
FPLE
1995
15 years 10 months ago
1995
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the ...