Searching networks with unrestricted at costs

Simple item page
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

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Binder1.pdf
Size:
2.67 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science