Local search for distributed SAT with complex local problems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Optimal Distributed Arc-Consistency
Constraints
CSPCONS: A Communicating Sequential Prolog with Constraints
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Distributed Configuration as Distributed Dynamic Constraint Satisfaction
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Sensor networks and distributed CSP: communication, computation and complexity
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Secure distributed constraint satisfaction: reaching agreement without revealing private information
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
International Journal of Computational Science and Engineering
Distributed Private Constraint Optimization
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Communicating sequential processes for distributed constraint satisfaction
Information Sciences: an International Journal
Solving coarse-grained DisCSPs with local search
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the potential speed up of a parallel exploration in the processing of distributed problems. This paper extends DIBT, a distributed search procedure operating in distributed constraint networks.The extension is twofold. First the procedure is up dated to face delayed information problems upcoming in heterogeneous systems. Second, the search is extended to simultaneously explore independent parts of a distributed search tree. By this way we introduce parallelism into distributed search, which brings to Interleaved Distributed Intelligent BackTracking (IDIBT). Our results show that 1) insoluble problems do not greatly degrade performance over DIBT and 2) super linear speed up can be achieved when the distribution of solution is nonuniform.