Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/3518
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDutta, P-
dc.contributor.authorDutta Majumder, D-
dc.date.accessioned2012-04-24T14:09:14Z-
dc.date.available2012-04-24T14:09:14Z-
dc.date.issued1999-
dc.identifier.citationAn international journal of mathematics and computer modelling,P57-72en_US
dc.identifier.urihttp://hdl.handle.net/10263/3518-
dc.language.isoenen_US
dc.subjectAlmost sure convergenceen_US
dc.subjectStochastic processen_US
dc.subjectMaximum likelihood estimatesen_US
dc.subjectAsymptotic joint distributionen_US
dc.subjectKnapack problemen_US
dc.titlePerformance evaluation of evolutionary class of algorithms-an application to knapsack problemen_US
dc.typeArticleen_US
Appears in Collections:Electronics

Files in This Item:
File Description SizeFormat 
Binder2.pdf2.64 MBAdobe PDFView/Open


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