Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.49 € Zbirna točka DPD 2.99 € Kurirska služba GLS 5.49 € Kurir DPD 3.49 € Kurirska služba 3.49 € Zbirno mesto 3.49 € Zbirno mesto 3.49 € Dostava preko Pošte Slovenije 3.49 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Distributed Constraint Satisfaction

Name: Distributed Constraint Satisfaction
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 07161305
Price: 48.91 EUR
Availability: InStock
Author: Makoto Yokoo
ISBN: 9783642640209

Foundations of Cooperation in Multi-agent Systems

Makoto Yokoo

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 07161305

Založba Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, oktober 2011

Distributed Constraint Satisfaction gives an overview of Constraint Satisfaction Problems (CSPs), ad... Celoten opis

Koda Libristo: 07161305

118 b

48.91 €

Na zalogi pri dobavitelju Odposlali bomo v 5-8 dneh

30 dni za vračilo blaga

Drugi so kupili tudi

Autonomie und Struktur in der modernen Bildung Rolf Niebel

Mehka

61.77 €

National Missile Defense Laura D. García Albesa

Mehka

32.81 €

Marketingkonzept fur Alumni M. Balke

Mehka

40.30 €

EMAKUMEEN ESKUBIDE POLITIKOAK ELIZONDO LOPETEGUI

Mehka

6.07 €

Tini Turnsternchen

Mehka

12.75 €

Eryl Florence Brichau-Prado

Mehka

14.47 €

Charakterkoepfe Aus Der Antiken Literatur Eduard Schwartz

Mehka

50.23 €

Distributed Constraint Satisfaction gives an overview of Constraint Satisfaction Problems (CSPs), adapts related search algorithms and consistency algorithms for applications to multi-agent systems, and consolidates recent research devoted to cooperation in such systems. The techniques introduced are applied to various problems in multi-agent systems. Among the new approaches is a hybrid-type algorithm for weak-commitment search combining backtracking and iterative improvement. Also, an extension of the basic CSP formalization called "Partial CSP" is introduced in order to handle over-constrained CSPs.