Optimal distributed arc-consistency

Constraints

Volumn 7, Issue 3-4, 2002, Pages 367-385

  Hamadi, Youssef ^a  

^a THALES RESEARCH AND TECHNOLOGY   (France)

Author keywords

Arc consistency; Distributed constraint satisfaction; Distributed problem solving; Parallel algorithms; Parallel relaxation; Phase transition

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; DISTRIBUTED PARAMETER CONTROL SYSTEMS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

DISTRIBUTED CONSTRAINT SATISFACTION PROBLEMS (DCSP);

OPERATIONS RESEARCH;

EID: 0036663089     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020594125144     Document Type: Conference Paper

References (22)

1. Bessière, C. (1994). Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1): 179-190.
2. Chandy, K.M., & Lamport, L. (1985). Distributed snapshots: determining global states of distributed systems. TOCS, 3(1): 63-75.
3. Clearwater, S.H., & Hogg, T. (1994). Exploiting problem structure in genetic algorithms. In Proceedings of AAAI, pages 1310-1315.
4. Cooper, P.R., & Swain, M.J. (1992). Arc consistency: parallelism and domain dependence. AI, 58(1-3): 207-235.
5. Culler, D.E., Liu, L.T., Martin, R.P., & Yoshikawa, C. (1996). LogP performance assessment of fast network interfaces. IEEE Micro.
6. Gent, I., Intyre, E.M., Prosser, P., & Walsh, T. (1997). The constrainedness of arc consistency. In Principles and Practice of Constraint Programming, pages 327-340.
7. Hamadi, Y. (1999). Traitement des problèmes de satisfaction de contraintes distribués. Ph.D. thesis, Université Montpellier II (in french).
8. Hamadi, Y. (2001a). Conflicting agents in distributed search. Technical Report HPL-2001-222, HP Labs.
9. Hamadi, Y. (2001b). Interleaved backtracking in distributed constraint networks. In IEEE, ed., 13th International Conference on Tools with Artificial Intelligence, to appear.
10. Hamadi, Y., Bessière, C., & Quinqueton, J. (1998). Backtracking in distributed constraint networks. In ECAI, pages 219-223.
11. Hamadi, Y., & Merceron, D. (1997). Reconfigurable architectures: a new vision for optimization problems. In Smolka, G., ed., Proceedings of the 3rd International Conference on Principle and Practice of Constraint Programming CP97, Vol. 1330 of LNCS, Linz, Austria, pages 209-221.
12. Hogg, T. (1995). Exploiting problem structure as a search heuristic. Unpublished.
13. Kasif, S. (1990). On the parallel complexity of discrete relaxation in constraint satisfaction networks. AI, 45(3): 275-286.
14. Mohr, R., & Henderson, T.C. (1986). Arc and path consistency revisited. Artificial Intelligence, 28: 225-233.
15. MPIF. (1994). MPI: a message-passing interlace standard. International Journal of Supercomputer Applications, 8(3/4).
16. Naor, M., & Stockmeyer, L. (1995). What can be computed locally? SIAM Journal of Computing, 24(6): 1259-1277.
17. Nguyen, T., & Deville, Y. (1995). A distributed arc-consistency algorithm. In First International Workshop on Concurrent Constraint Satisfaction.
18. Prosser, P., Conway, C., & Muller, C. (1992). A distributed constraint maintenance system. In Proceedings of the 12th International Conference on AI pages 221-231.
19. Sabin, D., & Freuder, E.C. (1994). Contradicting conventional wisdom in constraint satisfaction. In ECAI, pages 125-129.
20. Samal, A., & Henderson, T. (1987). Parallel consistent labeling algorithms. International Journal of Parallel Program, 16: 341-364.
21. Simonis, H. (1996). A problem classification scheme for finite domain constraint solving. In Proceedings of the CP'96 Workshop on Constraint Programming Applications: An Inventory and Taxonomy, pages 1-26.
22. Yokoo, M., & Hirayama, K. (1996). Distributed breakout algorithm for solving distributed constraint satisfaction problems. In ICMAS, pages 401-408.