Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Corriere Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Speeding Up Distributed Constraint Optimization Search Algorithms

Name: Speeding Up Distributed Constraint Optimization Search Algorithms
Brand: Scholars' Press
SKU: 07161122
Price: 74.39 EUR
Availability: InStock
Author: William Yeoh
ISBN: 9783639707212

William Yeoh

Lingua

Inglese

Libro In brossura

Codice Libristo: 07161122

Casa editrice Scholars' Press, gennaio 2014

Distributed constraint optimization (DCOP) is a model where several agents coordinate with each othe... Descrizione completa

Codice Libristo: 07161122

182 b

74.39 €

Magazzino esterno Inviamo tra 5-8 giorni

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

Émotions, Toxicomanie et Troubles de la personnalité Demis Casellini

In brossura

46.59 €

Die Leute von Privilege Hill Jane Gardam

Rigido

19.49 €

Bayreuther Festspiele Im Zeitalter Des Absolutismus: Studien Zur Geschichte Der Deutschen Oper (1908) Ludwig Schiedermair

In brossura

26.89 €

Le Mahabharata. Un récit fondateur du brahmanisme et son interprétation Madeleine Biardeau

In brossura

44.49 €

Como una luz encendida Vargas Valero

In brossura

21.49 €

Literarisches Lernen mit Medienverbuenden fuer Kinder und Jugendliche Muller Karla Muller

Adobe ePub DRM

66.79 €

Distributed constraint optimization (DCOP) is a model where several agents coordinate with each other to take on values so as to minimize the sum of the resulting constraint costs, which are dependent on the values of the agents. This model is becoming popular for formulating and solving multi-agent coordination problems. As a result, researchers have developed a class of DCOP algorithms that use search techniques. Since solving DCOP problems optimally is NP-hard, solving large problems efficiently becomes an issue. In this book, I show how one can speed up DCOP search algorithms by applying insights gained from centralized search algorithms, specifically by using an appropriate search strategy; by sacrificing solution optimality; by using more memory; and by reusing information gained from solving similar DCOP problems.