Graph theoretic algorithm for VLSI regular structures folding

Veuillez utiliser cette adresse pour citer ce document : http://edoc.bseu.by:8080/handle/edoc/85030

Titre:	Graph theoretic algorithm for VLSI regular structures folding
Auteur(s):	Cheremisinova, L.
Mots-clés:	computational costs;graph theoretic;one-dimensional unconstrained simple;вычислительные затраты
Date de publication:	2001
Editeur:	Белорусский государственный экономический университет
Language:	Английский
Type:	Article
Référence bibliographique:	Cheremisinova, L. Graph theoretic algorithm for VLSI regular structures folding / L. Cheremisinova // Информационные сети, системы и технологии = Information Networks, Systems and Technologies : в 3 кн. Кн.1 : Труды международной конференции ICINASTe'2001, Минск, 2-4 октября 2001 г. : на англ. яз. / Ред.: А.Н. Морозевич [и др.]. - Мн. : БГЭУ, 2001. - С. 98-102.
Résumé:	The problem under consideration is to reduce the area of the layout of regular VLS structures by means of their folding. Some results of cutting down exhaustive computational efforts on the search for the optimal regular structures folding have been described. An efficient graph theoretic algorithm for one-dimensional unconstrained simple folding is presented.
URI/URL:	http://edoc.bseu.by:8080/handle/edoc/85030
ISBN:	985-426-692-3
Collection(s) :	Информационные сети, системы и технологии = Information Networks, Systems and Technologies

Fichier(s) constituant ce document :

Fichier	Description	Taille	Format
Cheremisinova_L._.pdf		333.14 kB	Adobe PDF	Voir/Ouvrir

ЭЛЕКТРОННАЯБИБЛИОТЕКА БГЭУ