An Algorithm for Resource-based Configuration

We present an architecture independent algorithm for resource based configuration. A description of a knowledge base (static part) is presented along with its realization (data structure). A description of the configuration algorithm is given in terms of a search path, employed heuristics and cost based cut--off optimization. An architecture independent implementation and its parallelisation are described. Finally, heuristics which guide the search algorithm are presented and analyzed. Our goal --- the investigation of heuristics and mechanization of the learning process by means of massive parallel machines --- is outlined. 1 Introduction Configuration is usually described as the process of composing a technical system from a predefined set of objects. The result of such a process is called This work is supported by the DFG-SFB 376 "Massive Parallelit¨at". y WWW: http://www.uni-paderborn.de/fachbereich/AG/agklbue/ configuration too and has to fullfill a set of constraints give..