Multi-Hyb: A Hybrid Algorithm for Solving DisCSPs with Complex Local Problems

Abstract

A coarse-grained Distributed Constraint Satisfaction Problem (DisCSP) is a constraint problem where several agents, each responsible for solving one part (a complex local problem), cooperate to determine an overall solution. Thus, agents solve the overall problem by finding a solution to their complex local problem which is compatible with the solutions… (More)
DOI: 10.1109/WI-IAT.2009.181

Topics

3 Figures and Tables

Cite this paper

@article{Lee2009MultiHybAH, title={Multi-Hyb: A Hybrid Algorithm for Solving DisCSPs with Complex Local Problems}, author={David J Lee and In{\'e}s Arana and Hatem Ahriz and Kit-Ying Hui}, journal={2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology}, year={2009}, volume={2}, pages={379-382} }