Analysis of the Mean Field Annealing Algorithm for Graph Colouring
Shawe-Taylor, John and Zerovnik, Janez v (1993) Analysis of the Mean Field Annealing Algorithm for Graph Colouring.
We introduce the Multi State Bitstream Neuron. By replacing the stochastic activation function with stochastic weights the MSBSN is shown to approximate a Generalised Boltzmann Machine. Benchmarks show the algorithm performs as well as the Boltzmann algorithm whilst the MSBSN lends itself to a very compact and fast hardware implementation.
|Item Type:||Monograph (Technical Report)|
|Divisions :||Faculty of Physical Sciences and Engineering > Electronics and Computer Science
|Accepted Date and Publication Date:||
|Date Deposited:||12 Aug 2004|
|Last Modified:||31 Mar 2016 14:01|
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)