Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9585
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGupta, Ravi Kant-
dc.date.accessioned2014-11-19T13:27:24Z-
dc.date.available2014-11-19T13:27:24Z-
dc.date.issued1999-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9585-
dc.guideSarkar, S.-
dc.description.abstractThis dissertation describes a Self Adapting Messy Genetic Algorithm for Floorplan Area Optimization problem. The algorithm is based on suitable techniques for individual arrangement in population, their selection, solution encoding and evaluation function definition, effective modified heuristic operators, crossover,. mutation & RB-90 operators which further improve the method's effectiveness. Experimental results show that the modified algorithm is better than the existing algorithm as far as the CPU time requirements and result accuracy is considered. It requires a limited amount of memory, it is not sensible to special structures as it is independent from floorplan topology. Finally it is demonstrated that the modified algorithm is well suited for floorplan problems in which total number of implementations are large.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectVLSI-CHIP FLOOR PLAN AREAen_US
dc.subjectGENETIC ALGORITHMen_US
dc.subjectSELF ADAPTING MESSY GENETIC ALGORITHMen_US
dc.title. VLSI-CHIP FLOORPLAN AREA OPTIMIZATION BY GENETIC ALGORITHMen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number247968en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD247968.pdf6.71 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.