A method for test scheduling using an evolutionary approach. (c2000)

Noujaim, Jad

dc.contributor.author	Noujaim, Jad
dc.date.accessioned	2011-09-28T09:00:46Z
dc.date.available	2011-09-28T09:00:46Z
dc.date.copyright	2000	en_US
dc.date.issued	2011-09-28
dc.date.submitted	2000-06
dc.identifier.uri	http://hdl.handle.net/10725/642
dc.description	Includes bibliographical references (leaves 83-84).	en_US
dc.description.abstract	This study presents an evolutionary approach to solve the test-scheduling problem in VLSI circuits. Test Scheduling is an NP-complete problem and, in order to solve it, genetic algorithms are used. The number of cliques obtained after running the algorithm several times is the optimal solution. The convergence of the algorithm is evaluated using a set of examples. These tests indicate that the convergence rate is adequate and, therefore, validate the approach taken.	en_US
dc.language.iso	en	en_US
dc.subject	Genetic algorithms	en_US
dc.title	A method for test scheduling using an evolutionary approach. (c2000)	en_US
dc.type	Thesis	en_US
dc.term.submitted	Spring	en_US
dc.author.degree	MS in Computer Science	en_US
dc.author.school	Arts and Sciences	en_US
dc.author.idnumber	199432440	en_US
dc.author.commembers	Dr. Walid Keirouz
dc.author.commembers	Mr. Munjid Musallem
dc.author.woa	RA	en_US
dc.description.physdesc	1 bound copy: xii, 84 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.3	en_US
dc.publisher.institution	Lebanese American University	en_US