T. N. Bui and B. R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs", Proc. of the ACMIEEE  Home/Search   Document Not in Database   Summary   Related Articles   Check

....evolution occasionally interrupted by inter population communication. Although the investigated problems are from actual VLSI design efforts, comparisons with other approaches and runtimes are not presented. A hybrid genetic algorithm for the ratio cut partitioning problem is presented in [4]. Here the problem is formulated in terms of a hypergraph. The genetic encoding is a binary string, where each subset of the circuit s components has a corresponding location on the string. Before the genetic algorithm is executed, the ordering of these genes is determined by a depth first search ....

T. N. Bui and B. R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs", Proc. of the ACMIEEE

....Partitions with design violations are tolerated by means of a special penalty function. Results show that multiple subpopulations enhance the solution quality by exploiting wider regions of the search space. A hybrid genetic algorithm for the ratio cut partitioning problem is presented by [Bui and Moon (1994)] The ratio cut partitioning problem considers not only the cut size but also the size of the partitions. Here the problem is formulated in terms of a hypergraph. The modules are mapped to vertices and the nets are mapped to hyper edges. Each solution in the population is represented by a ....

Bui T.N. and Moon B.R., A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs, Proc. of the ACM-IEEE Design Automation Conference, 1994, pp. 664-669.

....h . Notice that f counts every cut edge twice; we do this to avoid 1 2 terms throughout this work. Min cut graph partitioning is known to be NP complete, so heuristic methods must be invoked. Previous approaches have included seeded epitaxial growth, iterative improvement [16] genetic algorithms [6], etc. Spectral methods [1] 2] 4] 7] 8] 11] 13] 15] have been successful in recent years and are of particular interest for our present work. These works share a common trait of using eigenvectors to construct some type of geometric representation of the graph. We note four such ....

T. N. Bui and B. R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs," Proc. ACM/IEEE Design Automation Conf., 1994, pp. 664-669.

....(SA) has been used for graph partitioning by Johnson et al. 1989) They showed that SA usually needs much more time than iterative improvement methods, specifically when used Manuscript No. 950502 8 N. Michelena and P. Papalambros on graphs generated with a built in geometric structure. Bui and Moon (1994) presented a hybrid genetic algorithm that combines a variation of the Fiduccia Mattheyses algorithm with genetic space exploration to give competitive performance. Spectral partitioning methods identify a good approximation to a K partition from global information about the structure of the ....

Bui, T.N. and Moon, B.R., 1994, A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs, Proceedings, 31th ACM/IEEE Design Automation Conference, pp. 664---669.

....annealing (SA) has been used for graph partitioning by Johnson et al. 34] and Bui et al. 10] with mixed results. They showed that SA usually needs much more time than iterative improvement methods, specifically when used on graphs generated with a built in geometric structure. Bui and Moon [11] presented a hybrid genetic algorithm that combines a variation of the Fiduccia Mattheyses algorithm with genetic space exploration to give competitive performance. Bui et al. 9] applied network flow techniques to graph bisection with good results for small degree graphs. 8 SPECTRAL GRAPH ....

T.N. Bui and B.R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs," in Proceedings 31th ACM/IEEE Design Automation Conference, pp. 664--669, 1994.

....D. de Abreu, 61] Mosca, R. 236] Mowchenko, Jack T. 330] Muddappa, S. 133] Mudge, Trevor, 178] Nakayama, T. 290] Narasimhan, R. 188] Nassar, K. 176, 199] Natsume, K. 215] Negoita, Mircea Gh. 271] Nelson, K. M. 32] Nemec, Viktor, 216] Ng, S. C. 149] Nguyen Bui, Thang, [150] Niermann, Thomas M. 15, 263] Niwa, Tatsuya, 333, 334] Noteboom, Ron, 189] O Dare, M. J. 134, 172, 190, 217, 242, 251, 88, 276] Ohmori, Kenji, 173] Ohmori, K. 206] Okmen, C. 272] Olson, Eric, 135] O Neill, A. W. 116] Ong, N. S. 106] Ono, N. 219] Ono, Norihiko, 314] Opaterny, ....

....M. S. 221] Reorda, Matteo Sonza, 244, 257, 258] Richards, Dana S. 296, 299] Richert, P. 321] Rietman, Edward A. 222] Rinderle, J. 117] Robertson, G. I. 80] Robinson, Gordon M. 26, 37] Rodanski, Benedykt, 42] Rodriguez, B. 208] Rogenmoser, Robert, 223] Ro Moon, Byung, [150] Ronald, Simon, 202] Rosenkrantz, D. J. 188] Roy, S. 205] 16 Genetic algorithms and VLSI Roy, U. 70] Rudnick, E. M. 210, 263] Rudnick, Elizabeth M. 15, 22, 175, 192, 229, 240] Russo, Marco, 183] Saab, Daniel G. 125, 22, 224, 319] Saab, Youssef G. 125, 224, 318, 319] ....

[Article contains additional citation context not shown here]

Thang Nguyen Bui and Byung Ro Moon. Fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs. In Proceedings of the 31st Design Automation Conference, pages 664--669, San Diego, CA, 6.-10. June 1994. IEEE, Piscataway, NJ. yEI M000420/95 ga94bNguyen.

....Moraga, C. 392] Mori, Hiroyuki, 159] Morimoto, H. 123] Mosetti, G. 476, 493] Mowchenko, Jack T. 193] Muddappa, S. 229] Musenich, R. 461] Nakatani, T. 324] Nakayama, T. 93] Nambiar, R. 152, 153] Nassar, K. 301, 345] Ndeh Che, F. 225] Nemec, Viktor, 368] Nguyen Bui, Thang, [257] Niklaus, J. 198] Nishiguchi, Masato, 357] Nomoto, Kenichi, 357] North, J. H. 405] Noteboom, Ron, 333] Obayashi, Shigeru, 465] Obradovi c, Zoran, 230] Ohmori, Kenji, 297] Oka, K. 24] Okino, Norio, 495] Olson, Eric, 231] Onder, H. H. 168, 169] O Neill, M. R. 205] Oommen, B. ....

....[235] Reynolds, Robert G. 270] Richards, Dana S. 104, 105] Richards, Gill G. 114] Richards, R. A. 494] Richards, Robert A, 469] Richards, Robert A. 483, 482] Riopel, D. 313] Ritcher, K. R. 149] Roberts, A. 259, 438] Roberts, J. 220] Robertshaw, H. H. 315] Ro Moon, Byung, [257] Rosenman, M. A. 300, 484] Ross, Peter, 291] Roston, Gerald Paul, 23] Rudnick, E. M. 337] Rudnick, M. 11] Rudnick, William Michael, 442] Saab, Youssef G. 180, 443, 181] Saha, Swapan, 237] Sahu, S. 340] Sait, S. M. 345] Sait, Sadiq M. 207, 252, 301, 338, 350, 371] Saito, H. ....

[Article contains additional citation context not shown here]

Thang Nguyen Bui and Byung Ro Moon. Fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs. In Proceedings of the 31st Design Automation Conference, pages 664--669, San Diego, CA, 6.-10. June 1994. IEEE, Piscataway, NJ. y(EI M000420/95) ga94bNguyen.

....annealing (SA) has been used for graph partitioning by Johnson et al. 34] and Bui et al. 10] with mixed results. They showed that SA usually needs much more time than iterative improvement methods, specifically when used on graphs generated with a built in geometric structure. Bui and Moon [11] presented a hybrid genetic algorithm that combines a variation of the Fiduccia Mattheyses algorithm with genetic space exploration to give competitive performance. Bui et al. 9] applied network flow techniques to graph bisection with good results for small degree graphs. SPECTRAL GRAPH ....

T.N. Bui and B.R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs," in Proceedings 31th ACM/IEEE Design Automation Conference, pp. 664--669, 1994.

....Simulated annealing (SA) has been used for graph partitioning by Johnson et al. 1989) and Bui et al. 1989) with mixed results. They showed that SA usually needs much more time than iterative improvement methods, specifically when used on graphs generated with a built in geometric structure. Bui and Moon (1994) presented a hybrid genetic algorithm that combines a variation of the Fiduccia Mattheyses algorithm with genetic space exploration to give competitive performance. Bui et al. 1987) applied network flow techniques to graph bisection with good results for small degree graphs. OPTIMAL MODEL BASED ....

Bui, T.N. and Moon, B.R., 1994, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs," Proceedings, 31th ACM/IEEE Design Automation Conference, pp. 664--669.

....input to an iterative improvement algorithm. Simulated annealing (SA) has been used for graph partitioning by Johnson et al. 1989) They showed that SA usually needs much more time than iterative improvement methods, specifically when used on graphs generated with a built in geometric structure. Bui and Moon (1994) presented a hybrid genetic algorithm that combines a variation of the Fiduccia Mattheyses algorithm with genetic space exploration to give competitive performance. Spectral partitioning methods identify a good approximation to a K partition from global information about the structure of the ....

Bui, T.N. and Moon, B.R., 1994, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs," Proceedings, 31th ACM/IEEE Design Automation Conference, pp. 664--669.

No context found.

T. N. Bui and B. R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraph", Proc. 31th ACM/IEEE Design Automation Conference, 1994, to appear.

No context found.

T. N. Bui, B. R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs", DAC, pp. 664-669, 1994.

No context found.

T. N. Bui, B. R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs", Design Automation Conference, pp. 664-669, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC