Meisels | Distributed Search by Constrained Agents | Buch | 978-1-84800-039-1 | sack.de

Buch, Englisch, 216 Seiten, Format (B × H): 167 mm x 243 mm, Gewicht: 1140 g

Reihe: Advanced Information and Knowledge Processing

Meisels

Distributed Search by Constrained Agents

Algorithms, Performance, Communication
2008. Auflage 2007
ISBN: 978-1-84800-039-1
Verlag: Springer

Algorithms, Performance, Communication

Buch, Englisch, 216 Seiten, Format (B × H): 167 mm x 243 mm, Gewicht: 1140 g

Reihe: Advanced Information and Knowledge Processing

ISBN: 978-1-84800-039-1
Verlag: Springer


Distributed search by agents is an important topic of distributed AI and has not been treated thoroughly as such. While the scope of work on multi-agent systems has grown steadily over the last decade, very little of it has spilled into distributed search. In conrast, the constraints processing community has produced a sizable body of work on distributed constrained search. Parado- cally, a community that concentrates on search algorithms and heuristics has created a distributed model for agents that cooperate on solving hard search problems. Traditionally, this ?eld has been named Ditributed Constraints S- isfaction and lately also distributed constraints optimization. The present book attempts to prompt deeper response from the MAS community and hopefully to give rise to cooperative work on distributed search by agents. In order to achieve this high goal, the book presents the large body of work on distributed search by constrained agents. The presentation emphasizes many aspects of distributed computation that connect naturally to multi-agent systems, - pecially measures of performance for distributed search algorithms and the impact of delays in communication. Distributed Constraints Satisfaction Problems (DisCSPs) have been st- ied over the last decade, starting with the pioneering proposal by Makoto Yokoo [18]. The ?rst distributed search algorithm for DisCSPs - As- chronous Backtracking (ABT) - was ?rst published in complete format in 1998 [64]. The ?rst book on Distributed Constraints Satisfaction Problems has appeared as early as 2000 [61].

Meisels Distributed Search by Constrained Agents jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


Constraints Satisfaction Problems - CSPs.- Constraints Optimization Problems - COPs.- Distributed Search.- Asynchronous Backtracking (ABT).- Asynchronous Forward-Checking.- Concurrent Dynamic Backtracking.- Distributed Ordering Heuristics.- Asynchronous Ordering Heuristics.- Performance measures for distributed search.- Experimental Evaluation of DisCSP Algorithms.- The Impact of Communication - Message Delays.- Message Delays and DisCSP Search Algorithms.- Distributed Constraint Optimization Problems (DisCOPs).- Asynchronous Optimization for DisCOPs.- Asynchronous Forward-Bounding.- Extending AFB - BackJumping.- Empirical Evaluation of DisCOP algorithms.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.