A method for test scheduling using an evolutionary approach. (c2000)
Includes bibliographical references (leaves 83-84).
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | masterThesis |
| منشور في: |
2000
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/642 https://doi.org/10.26756/th.2000.3 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513454551859200 |
|---|---|
| author | Noujaim, Jad |
| author_facet | Noujaim, Jad |
| author_role | author |
| dc.creator.none.fl_str_mv | Noujaim, Jad |
| dc.date.none.fl_str_mv | 2000 2000-06 2011-09-28T09:00:46Z 2011-09-28T09:00:46Z 2011-09-28 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/642 https://doi.org/10.26756/th.2000.3 |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | Lebanese American University |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Genetic algorithms |
| dc.title.none.fl_str_mv | A method for test scheduling using an evolutionary approach. (c2000) |
| dc.type.none.fl_str_mv | Thesis info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/masterThesis |
| description | Includes bibliographical references (leaves 83-84). |
| eu_rights_str_mv | openAccess |
| format | masterThesis |
| id | LAURepo_fcabb795ffda196365a3d942dee79420 |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/642 |
| publishDate | 2000 |
| publisher.none.fl_str_mv | Lebanese American University |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A method for test scheduling using an evolutionary approach. (c2000)Noujaim, JadGenetic algorithmsIncludes bibliographical references (leaves 83-84).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.1 bound copy: xii, 84 leaves; ill.; 30 cm. available at RNL.Lebanese American University2011-09-28T09:00:46Z2011-09-28T09:00:46Z20002011-09-282000-06Thesisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesishttp://hdl.handle.net/10725/642https://doi.org/10.26756/th.2000.3eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/6422023-05-04T09:18:35Z |
| spellingShingle | A method for test scheduling using an evolutionary approach. (c2000) Noujaim, Jad Genetic algorithms |
| status_str | publishedVersion |
| title | A method for test scheduling using an evolutionary approach. (c2000) |
| title_full | A method for test scheduling using an evolutionary approach. (c2000) |
| title_fullStr | A method for test scheduling using an evolutionary approach. (c2000) |
| title_full_unstemmed | A method for test scheduling using an evolutionary approach. (c2000) |
| title_short | A method for test scheduling using an evolutionary approach. (c2000) |
| title_sort | A method for test scheduling using an evolutionary approach. (c2000) |
| topic | Genetic algorithms |
| url | http://hdl.handle.net/10725/642 https://doi.org/10.26756/th.2000.3 |