MULTIPROCESSOR DOCUMENT ALLOCATION - A GENETIC ALGORITHM APPROACH

We formally define the Multiprocessor Document Allocation Problem (MDA P) and prove it to be computationally intractable (NP Complete). Once it is shown that MDAP is NP Complete, we describe a document allocatio n algorithm based on genetic algorithms. This algorithm assumes that t he documents are clustered using any one of the many clustering techni ques. We later show that our allocation algorithm probabilistically co nverges to a good solution. For a behavioral evaluation, we present sa mple experimental results.