Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 54-67 |
Number of pages | 14 |
Journal | Systems and Computers in Japan |
Volume | 25 |
Issue number | 12 |
Publication status | Published - 1994 Nov 1 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Hardware and Architecture
- Computational Theory and Mathematics