Dynamic backtracking for distributed constraint optimization1

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 901-902

  Ezzahir, Redouane ^a   Bessiere, Christian ^b   Benelallam, Imade ^a   Bouyakhf, El Houssine ^a   Belaissaoui, Mustapha ^c  

^a FACULTÉ DES SCIENCES   (Morocco)

^b LIRMM   (France)

^c HASSAN 1ST UNIVERSITY   (Morocco)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ALGORITHM FOR SOLVING; BRANCH AND BOUND SEARCH; CONSTRAINT OPTIMIZATION PROBLEMS; DISTRIBUTED CONSTRAINT OPTIMIZATIONS; DYNAMIC BACKTRACKING; DYNAMIC ORDER; LOW BOUND; POLYNOMIAL SPACE; SPEED UP; SUB-PROBLEMS;

CONSTRAINED OPTIMIZATION;

EID: 85014356870     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-901     Document Type: Conference Paper

References (7)

1. A. Chechetka and K. Sycara., ‘No-commitment branch and bound search for distributed constraint optimization’, in AAMAS, pp. 1427–1429, (2006).
2. P. Dago and G. Verfaillie, ‘Nogood recording for valued constraint satisfaction problems’, in ICTAI, pp. 132–139, (1996).
3. R. Ezzahir, C. Bessiere, M. Belaissaoui, and E.H. Bouyakhf., ‘Dischoco: A platform for distributed constraint programming.’, in IJCAI’07 Workshop on DCR, pp. 16–21, (2007).
4. R. Ezzahir, C. Bessiere, E. H. Bouyakhf, I. Benelallam, and M. Belaissaoui, ‘Asynchronous breadth-first search DisCOP algorithm’, in EU-MAS’07, (2007).
5. A. Gershman, A. Meisels, and R. Zivan, ‘Asynchronous forward-bounding with backjumping’, in IJCAI’07 Workshop on DCR, pp. 28–39, (2007).
6. A. Gershman, R. Zivan, T. Grinshpoun, A. Grubshtein, and A. Meisels, ‘Measuring distributed constraint optimization algorithms’, in AAMAS’08 Workshop on DCR, (2008).
7. M.C. Silaghi and M. Yokoo, ‘Nogood based asynchronous distributed optimization (adopt-ng)’, in AAMAS, pp. 1389–1396, (2006).