| Presentation | 1997/6/23 Search Ability of Chaotic Brownian Network Junichi Machida, Toshihiro Shimizu, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In a previous report Chaotic Brownian Network (CBN) was applied to the traveling salesman problem (TSP). It was shown that the network can find the shortest path with the ratio of 100% without being trapped in any one of the local minima. In this paper the mechanism is studied. A new simple model with the same character is proposed. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Neural Network / Chaos / TSP |
| Paper # | NLP97-48 |
| Date of Issue |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 1997/6/23(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Nonlinear Problems (NLP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Search Ability of Chaotic Brownian Network |
| Sub Title (in English) | |
| Keyword(1) | Neural Network |
| Keyword(2) | Chaos |
| Keyword(3) | TSP |
| 1st Author's Name | Junichi Machida |
| 1st Author's Affiliation | Graduate School of Engineering, Kokushikan University() |
| 2nd Author's Name | Toshihiro Shimizu |
| 2nd Author's Affiliation | Graduate School of Engineering, Kokushikan University |
| Date | 1997/6/23 |
| Paper # | NLP97-48 |
| Volume (vol) | vol.97 |
| Number (no) | 126 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |