Abstract
An approximate solution to an NP-hard discrete optimization problem, namely finding maximum clique, will be given using cellular neural networks. Even though the problem is defined by discrete variables, continuous cellular network will be used. The maximal cliques will be the stable states of the cellular neural networks. To illustrate the performance of the method, the results will be compared with some existing models as saturated linear dynamical network, continuous Hopfield dynamics.
| Original language | English |
|---|---|
| Pages | 208-211 |
| Number of pages | 4 |
| Publication status | Published - 1998 |
| Event | Proceedings of the 1998 5th IEEE International Workshop on Cellular Neural Networks and Their Applications, CNNA - London, UK Duration: 14 Apr 1998 → 17 Apr 1998 |
Conference
| Conference | Proceedings of the 1998 5th IEEE International Workshop on Cellular Neural Networks and Their Applications, CNNA |
|---|---|
| City | London, UK |
| Period | 14/04/98 → 17/04/98 |