Artboard 33 Artboard 16 Artboard 18 Artboard 15 Artboard 21 Artboard 1 Artboard 2 Artboard 5 Artboard 45 Artboard 45 Artboard 22 Artboard 9 Artboard 23 Artboard 17? Artboard 28 Artboard 43 Artboard 49 Artboard 47 Artboard 38 Artboard 32 Artboard 8 Artboard 22 Artboard 5 Artboard 25 Artboard 1 Artboard 42 Artboard 11 Artboard 41 Artboard 13 Artboard 23 Artboard 10 Artboard 4 Artboard 9 Artboard 20 Artboard 6 Artboard 11 Artboard 7 Artboard 3 Artboard 3 Artboard 12 Artboard 25 Artboard 34 Artboard 39 Artboard 24 Artboard 13 Artboard 19 Artboard 7 Artboard 24 Artboard 31 Artboard 4 Artboard 14 Artboard 27 Artboard 30 Artboard 36 Artboard 44 Artboard 12 Artboard 17 Artboard 17 Artboard 6 Artboard 27 Artboard 19 Artboard 30 Artboard 29 Artboard 29 Artboard 26 Artboard 18 Artboard 2 Artboard 20 Artboard 35 Artboard 15 Artboard 14 Artboard 48 Artboard 50 Artboard 26 Artboard 16 Artboard 40 Artboard 21 Artboard 29 Artboard 10 Artboard 37 Artboard 3 Artboard 3 Artboard 46 Artboard 8
e-book

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems (Cód: 9285294)

Mohamed Wahbi

Wiley (Digital)

Ooops! Este produto não está mais a venda.
Mas não se preocupe, temos uma versão atualizada para você.

Ooopss! Este produto está fora de linha, mas temos outras opções para você.
Veja nossas sugestões abaixo!

R$ 106,07 R$ 74,25 (-30%) em até 2x de R$ 37,13 sem juros
Cartão Saraiva R$ 74,25 ou em até 3x de R$ 24,75 sem juros

Crédito:
Boleto:
Cartão Saraiva:

Total: R$0,00

Em até 2x sem juros de R$ 0,00


Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

R$74,25

Descrição

DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence.
A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents. This distribution is mainly due to privacy and/or security requirements. Therefore, a distributed model allowing a decentralized solving process is more adequate to model and solve such kinds of problem. The distributed constraint satisfaction problem has such properties. Contents Introduction
Part 1. Background on Centralized and Distributed Constraint Reasoning
1. Constraint Satisfaction Problems
2. Distributed Constraint Satisfaction Problems
Part 2. Synchronous Search Algorithms for DisCSPs
3. Nogood Based Asynchronous Forward Checking (AFC-ng)
4. Asynchronous Forward Checking Tree (AFC-tree)
5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search
Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs
6. Corrigendum to “Min-domain Retroactive Ordering for Asynchronous Backtracking”
7. Agile Asynchronous BackTracking (Agile-ABT)
Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning
8. DisChoco 2.0
9. Conclusion

About the Authors Mohamed Wahbi is currently an associate lecturer at Ecole des Mines de Nantes in France. He received his PhD degree in Computer Science from University Montpellier 2, France and Mohammed V University-Agdal, Morocco in 2012 and his research focused on Distributed Constraint Reasoning.

Características

Peso 0.00 Kg
Produto sob encomenda Sim
Marca Wiley (Digital)
Número de Páginas 176 (aproximado)
Acabamento e-book
Formato Livro Digital Pdf
Gratuito Não
Proteção Drm Sim
Código do Formato Pdf
Cód. Barras 9781118753521
Número da edição 1
Ano da Publicação 113
AutorMohamed Wahbi