589 search results - page 24 / 118 » Generalized Dominators and Post-Dominators |
113
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
121
click to vote
ICCAD
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
110
click to vote
FS
2006
15 years 3 months ago
2006
General deviation measures are introduced and studied systematically for their potential applications to risk management in areas like portfolio optimization and engineering. Such...
139
click to vote
DATE
1997
IEEE
15 years 8 months ago
1997
IEEE
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
125
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...