We consider the problem of distributing the documents to a given set of processors so that the load on each processor is as equal as possible and the amount of communication is as small as possible. This is an NP-Complete problem. We apply continuous as well as discrete Hopfield neural networks to obtain suboptimal solutions for the problem. These networks perform better than a genetic algorithm for this task proposed by Frieder et al. ; in particular, the continuous Hopfield network performs extremely well.
Al-Sehibani, Abdulaziz Sultan; Mehrotra, Kishan; Mohan, Chilukuri; and Ranka, Sanjay, "Multiprocessor Document Allocation: a Neural Network Approach" (1994). Electrical Engineering and Computer Science Technical Reports. Paper 151.