| Presentation | 1997/10/7 Chaos Heuristic Search for Graph Partitioning Problem Masaya OHTA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this report, a new algorithm for a combinatorial optimization problem using chaotic dynamics has been proposed. The method, in this report it's called Chaos Heuristic Search: CHS, has been derived from the Boltzmann Machine (BM) and the Chaotic Neural Network by Nozawa. It has been applied for a graph partitioning problem and confirmed its effectiveness. Then, the relation between chaotic dynamics and ability of optimization has been studied from comparison between CHS and BM experimentally. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | chaos / neural network / Boltzmann Machine / graph partitioning problem / heuristic search |
| Paper # | NLP97-99-112 |
| Date of Issue |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 1997/10/7(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) | Chaos Heuristic Search for Graph Partitioning Problem |
| Sub Title (in English) | |
| Keyword(1) | chaos |
| Keyword(2) | neural network |
| Keyword(3) | Boltzmann Machine |
| Keyword(4) | graph partitioning problem |
| Keyword(5) | heuristic search |
| 1st Author's Name | Masaya OHTA |
| 1st Author's Affiliation | Osaka Electro-Communication University() |
| Date | 1997/10/7 |
| Paper # | NLP97-99-112 |
| Volume (vol) | vol.97 |
| Number (no) | 301 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |