Parallel implementation of clique partitioning using artificial neural networks. (c2000)

LAUR Repository

Show simple item record

dc.contributor.author Hajj, Hisham
dc.date.accessioned 2011-10-13T05:47:36Z
dc.date.available 2011-10-13T05:47:36Z
dc.date.copyright 2000 en_US
dc.date.issued 2011-10-13
dc.date.submitted 2000-07-03
dc.identifier.uri http://hdl.handle.net/10725/752
dc.description Bibliography: leave 53. en_US
dc.description.abstract This work presents a parallel algorithm that simulates a neural network. The neural network solves the Clique Partitioning Problem, an NP-complete problem. Clique partitioning is used to solve the Data Path allocation problem, an important part of High Level Synthesis in VLSI circuits design. en_US
dc.language.iso en en_US
dc.subject Neural networks (Computer science) en_US
dc.subject Parallel processing (Electronic computers) en_US
dc.subject Parallel algorithms en_US
dc.title Parallel implementation of clique partitioning using artificial neural networks. (c2000) en_US
dc.type Thesis en_US
dc.term.submitted Summer I en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.commembers Dr. Walid Keirouz
dc.author.woa RA en_US
dc.description.physdesc 1 bound copy: ix, 53 leaves; ill.; 30 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Haidar Harmanani
dc.identifier.doi https://doi.org/10.26756/th.2000.4 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account