Frete Grátis
  • Google Plus
Livro Digital

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 em até 3x de R$ 35,36 sem juros
Cartão Saraiva R$ 100,77 (-5%) em até 1x no cartão ou em até 5x de R$ 21,21 sem juros
Grátis

Cartão Saraiva

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

Produto sob encomenda Sim
Marca Wiley (Digital)
Cód. Barras 9781118753521
Início da Venda 10/12/2015
Territorialidade Internacional
Formato Livro Digital Pdf
Gratuito Não
Proteção Drm Sim
Número da edição 1
Idioma 337
Código do Formato Pdf
Ano da Publicação 113
Peso 0.00 Kg
AutorMohamed Wahbi

Avaliações

Avaliação geral: 0

Você está revisando: Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction ... (Cód: 9285294) Algorithms and Ordering Heuristics for Distributed... (Cód: 9285294)
R$ 106,07
Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction ... (Cód: 9285294) Algorithms and Ordering Heuristics for Distributed... (Cód: 9285294)
R$ 106,07