A stochastic evolution algorithm for the graph covering problem and its application to the technology mapping

A stochastic evolution algorithm is applied to solve the graph covering problem in which a set of patterns that fully covers a subject graph with a minimal cost is sought. This problem is a typical constrained combinatorial optimization problem and is proven to be NP-complete. Many branch-and-bound...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of 1996 IEEE International Conference on Evolutionary Computation (ICEC '96): May 20-22, 1996, Symposion & Toyoda Auditorium, Nagoya University, Japan s. 475 - 479
Hlavní autori:	Dae-Hyun Lee, Hoon Choi, Lae-Jeong Park, Cheol Hoon Park, Seung Ho Hwang
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 1996
Predmet:	Business continuity Encoding Heuristic algorithms Libraries Logic circuits Pattern matching Space technology Stochastic processes Tree graphs Very large scale integration
ISBN:	9780780329027, 0780329023
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!