Boltzmann machines and their applications
Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computer Methods for Mathematical Computations
Computer Methods for Mathematical Computations
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
A Framework for Reinforcement-Based Scheduling in Parallel Processor Systems
IEEE Transactions on Parallel and Distributed Systems
Multi-heuristic list scheduling genetic algorithm for task scheduling
Proceedings of the 2003 ACM symposium on Applied computing
| Hi-index | 0.00 |
Hopfield and Tank's proposed technique for embedding optimization problems, such as the travelling salesman, in mean-field thermodynamic networks suffers from several restrictions. In particular, each discrete optimization problem must be reduced to the minimization of a 0-1 Hamiltonian. Hopfield and Tank's technique yields fully-connected networks of functionally homogeneous visible units with low-order symmetric connections. We present a program-constructive approach to embedding difficult problems in neural networks. Our derivation method overcomes the Hamiltonian reducibility requirement and promotes networks with functionally heterogeneous hidden units and asymmetric connections of both low and high-order. The underlying mechanism involves the decomposition of arbitrary problem energy gradients into piecewise linear functions which can be modeled as the outputs of small groups of hidden units. To illustrate our method, we derive thermodynamic mean-field neural networks for multiprocessor scheduling. Simulation of tuned networks of up to 2,400 units to yields very good, and often, exact solutions.