Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/3349
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDasgupta, Partha Sarathi-
dc.contributor.authorSen, A K-
dc.contributor.authorNandy, Subhas C-
dc.contributor.authorBhattacharya, Bhargab B-
dc.date.accessioned2012-03-22T14:50:27Z-
dc.date.available2012-03-22T14:50:27Z-
dc.date.issued2001-
dc.identifier.citationIEEE transactions on systems,man and cybernetics,V31,P497-507en_US
dc.identifier.urihttp://hdl.handle.net/10263/3349-
dc.language.isoenen_US
dc.subjectArtificial intelligenceen_US
dc.subjectHeuristic searchen_US
dc.subjectNumber partitioningen_US
dc.subjectVLSI floor planningen_US
dc.titleSearching networks with unrestricted at costsen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
Binder1.pdf2.73 MBAdobe PDFView/Open


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