117 search results - page 13 / 24 » Hybrid constructive heuristics for the critical node problem |
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
CCR
2005
14 years 10 months ago
2005
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
VLSID
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
102
click to vote
TSMC
2010
14 years 5 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...