Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/180Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Santosh Reddy, Y | - |
| dc.date.accessioned | 2005-12-19T06:30:18Z | - |
| dc.date.available | 2005-12-19T06:30:18Z | - |
| dc.date.issued | 2005 | - |
| dc.identifier.citation | Proceedings of the 9th International Workshop on Cellular Neural Networks and Their Applications, May 28-30, P 89-93 | en |
| dc.identifier.uri | http://hdl.handle.net/2080/180 | - |
| dc.description | Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. DOI:10.1109/CNNA.2005.1543168 | en |
| dc.description.abstract | In this paper, we present an artificial life method of the Cellular neural network for Max-Clique problem. The method is intended to provide an optimum parallel algorithm for solving the Max-Clique problem. To do this we use the Cellular neural network to get a maximum Clique. Some of the instances are simulated to verify the proposed method with the simulation results showing that the solution quality is superior to that of best existing parallel algorithm. We also test the learning method on total coloring problem. | en |
| dc.format.extent | 3632712 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en | - |
| dc.publisher | IEEE | en |
| dc.subject | Max-Clique | en |
| dc.subject | Cellular Neural Network | en |
| dc.title | Solving Max-Clique Using Cellular Neural Network | en |
| dc.type | Article | en |
| Appears in Collections: | Conference Papers | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.