### Abstract

The authors consider the convergence speed of mean field annealing (MFA). They combine MFA with the microcanonical simulation (MCS) method and propose an algorithm called microcanonical mean field annealing (MCMFA). In the proposed algorithm, cooling speed is controlled by current temperature so that computation in the MFA can be reduced without degradation of performance. In addition, the solution quality of MCMFA is not affected by the initial temperature. The properties of MCMFA are analyzed with a simple example and simulated with Hopfield neural networks. In order to compare MCMFA with MFA, both algorithms are applied to graph bipartitioning problems. Simulation results show that MCMFA produces a better solution than MFA.

Original language | English (US) |
---|---|

Title of host publication | 91 IEEE Int Jt Conf Neural Networks IJCNN 91 |

Publisher | Publ by IEEE |

Pages | 941-946 |

Number of pages | 6 |

ISBN (Print) | 0780302273 |

State | Published - Dec 1 1991 |

Event | 1991 IEEE International Joint Conference on Neural Networks - IJCNN '91 - Singapore, Singapore Duration: Nov 18 1991 → Nov 21 1991 |

### Publication series

Name | 91 IEEE Int Jt Conf Neural Networks IJCNN 91 |
---|

### Other

Other | 1991 IEEE International Joint Conference on Neural Networks - IJCNN '91 |
---|---|

City | Singapore, Singapore |

Period | 11/18/91 → 11/21/91 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*91 IEEE Int Jt Conf Neural Networks IJCNN 91*(pp. 941-946). (91 IEEE Int Jt Conf Neural Networks IJCNN 91). Publ by IEEE.