By Topic

The allocation of documents in multiprocessor information retrieval systems: an application of genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Siegelmann, H.T. ; Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA ; Frieder, O.

The determination of an optimal document allocation within a distributed memory, distributed input/output (I/O) multicomputer, the multiprocessor document allocation problem (MDAP), is an NP-complete problem. Obtaining an optimal document allocation, therefore, is computationally intractable, and, hence, heuristic approaches are required. A genetic-algorithm-based approach to MDAP is described. A proof convergence for the algorithm is provided. Some experimental results from a simulation study of the approach are given. The results illustrate the potential of the genetic-algorithm-based approach as a means of tackling MDAP

Published in:

Systems, Man, and Cybernetics, 1991. 'Decision Aiding for Complex Systems, Conference Proceedings., 1991 IEEE International Conference on

Date of Conference:

13-16 Oct 1991