701 search results - page 28 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
ISPD
2003
ACM
14 years 19 days ago
2003
ACM
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
IPL
2010
13 years 5 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
ANTSW
2010
Springer
13 years 5 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...