The distributed constraint satisfaction algorithm is considered. It attempts to improve the processing speed by introducing the ordering based on heuristics. The ordering is a technique which suppresses the expansion of search space by ordering the variables and the value assignments. The communication path allocation problem is considered as an application of the distributed constraint satisfaction. The presented method is evaluated through the problems derived from the actual data of the communication network, and the effectiveness of the ordering is demonstrated.
|ジャーナル||Systems and Computers in Japan|
|出版ステータス||Published - 1994 11 1|
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Hardware and Architecture
- Computational Theory and Mathematics