2313 search results - page 161 / 463 » On Heuristic Time Hierarchies |
165
click to vote
ISVLSI
2005
IEEE
16 years 3 days ago
2005
IEEE
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
155
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
153
click to vote
NCA
2003
IEEE
15 years 11 months ago
2003
IEEE
Due to the popularity of high-speed networks and advances in packaging and interface technologies, there has been significant efforts for providing high performance applications a...
179
click to vote
EUROMICRO
2000
IEEE
15 years 11 months ago
2000
IEEE
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
152
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper, we propose an integrated approach for register-sensitive software pipelining. In this approach, the heuristics proposed in the stage scheduling method of Eichenberg...