Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/3349| Title: | Searching networks with unrestricted at costs |
| Authors: | Dasgupta, Partha Sarathi Sen, A K Nandy, Subhas C Bhattacharya, Bhargab B |
| Keywords: | Artificial intelligence Heuristic search Number partitioning VLSI floor planning |
| Issue Date: | 2001 |
| Citation: | IEEE transactions on systems,man and cybernetics,V31,P497-507 |
| URI: | http://hdl.handle.net/10263/3349 |
| Appears in Collections: | Computer Science |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Binder1.pdf | 2.73 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.