Locally Optimal Algorithms for Designing Schedules Based on Hopfield Networks

Authors:
V. A. Kostenko;A. V. Vinokurov
Affiliations:
Department of Computational Mathematics and Cybernetics, Moscow State University, Vorob'evy gory, Moscow, 119992 Russia kost@cs.msu.su;Department of Computational Mathematics and Cybernetics, Moscow State University, Vorob'evy gory, Moscow, 119992 Russia kost@cs.msu.su
Venue:
Programming and Computing Software
Year:
2003

Citing 3
Cited 0

Neural computing: theory and practice

Neural computing: theory and practice
Improving local search heuristics for some scheduling problems. Part II

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

Locally optimal algorithms for designing schedules for program execution on multiprocessors based on Hopfield networks are considered. Results of the numerical investigations of these algorithms are presented.