5606 search results - page 629 / 1122 » Randomization Techniques for Graphs. |
168
click to vote
SCAM
2003
IEEE
16 years 9 days ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...
168
click to vote
DATE
2010
IEEE
16 years 4 days ago
2010
IEEE
Abstract—Media processing systems often have limited resources and strict performance requirements. An implementation must meet those design constraints while minimizing resource...
211
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
185
click to vote
DAC
1989
ACM
15 years 11 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
194
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...