Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/6279
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDalai, Deepak Kumar-
dc.date.accessioned2016-07-04T19:12:01Z-
dc.date.available2016-07-04T19:12:01Z-
dc.date.issued2003-
dc.identifier.citation22p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6279-
dc.descriptionDissertation under the supervision of Dr. Subhamoy Maitraen_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;2003-107-
dc.subjectPolynomial generatoren_US
dc.subjectSimulated annealingen_US
dc.subjectBinary stringsen_US
dc.titleFinding the approximate generator polynomial and corresponding initial sequence of a given binary string using simulated annealingen_US
dc.typeThesisen_US
Appears in Collections:Dissertations - M Tech (CS)

Files in This Item:
File Description SizeFormat 
DISS-107.PDFDissertation is the original PDF511.38 kBAdobe PDFView/Open


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