Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://edoc.bseu.by:8080/handle/edoc/85030Langanzeige der Metadaten
| DC Element | Wert | Sprache |
|---|---|---|
| dc.contributor.author | Cheremisinova, L. | - |
| dc.date.accessioned | 2020-11-11T07:54:08Z | - |
| dc.date.available | 2020-11-11T07:54:08Z | - |
| dc.date.issued | 2001 | - |
| dc.identifier.citation | 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. | ru_RU |
| dc.identifier.isbn | 985-426-692-3 | - |
| dc.identifier.uri | http://edoc.bseu.by:8080/handle/edoc/85030 | - |
| dc.description.abstract | 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. | ru_RU |
| dc.language | Английский | - |
| dc.language.iso | en | ru_RU |
| dc.publisher | Белорусский государственный экономический университет | ru_RU |
| dc.subject | computational costs | ru_RU |
| dc.subject | graph theoretic | ru_RU |
| dc.subject | one-dimensional unconstrained simple | ru_RU |
| dc.subject | вычислительные затраты | ru_RU |
| dc.title | Graph theoretic algorithm for VLSI regular structures folding | ru_RU |
| dc.type | Article | ru_RU |
| Enthalten in den Sammlungen: | Информационные сети, системы и технологии = Information Networks, Systems and Technologies | |
Dateien zu dieser Ressource:
| Datei | Beschreibung | Größe | Format | |
|---|---|---|---|---|
| Cheremisinova_L._.pdf | 333.14 kB | Adobe PDF | Öffnen/Anzeigen |
Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt, soweit nicht anderweitig angezeigt.
