3663 search results - page 243 / 733 » Problems in the ontology of computer programs |
157
click to vote
ISCC
2005
IEEE
16 years 6 days ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
193
click to vote
DAC
2006
ACM
2006
ACM
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
16 years 18 days ago
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
155
click to vote
WEBDB
1998
Springer
15 years 10 months ago
1998
Springer
In its infancy, the World-Wide Web consisted of a web of largely static hypertext documents. As time progresses it is evolving into a domain which supports almost arbitrary network...
148
click to vote
LCPC
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
169
click to vote
MP
2006
15 years 6 months ago
2006
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...