Isbn: 9798191442525 - graph-grounded agents: a practical engineering playbook for reliable loops, shared memory, and verifiable multi-agent systems (4 risultati)

- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,76
EUR 3,85 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 19,45
EUR 35,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. Neuware - An AI agent can complete a difficult task and still leave the next run with almost nothing useful. Plans, evidence, failed attempts, and decisions remain trapped in conversation history. Add more workers, and the problem becomes expensive duplication, weak coordination, and results that are hard to verify. Graph-Grounded Agents is a practical engineering playbook for turning temporary agent activity into connected, inspectable system state. Inside, you will learn how to: - build a bounded keep-or-reject improvement loop- represent tasks, artifacts, trials, claims, evaluations, and approvals- preserve experiment lineage without replaying full transcripts- assemble compact context bundles from relevant graph neighborhoods- divide multi-agent work without multiplying noise- evaluate both final artifacts and the actions used to create them- enforce provenance, permissions, budgets, and human gates>The book is framework-neutral. Its schemas, checklists, exercises, and 30-day plan can be implemented with files and Git, a relational database, a graph database, or a combination. For engineers and technical leads moving from impressive demos to reliable agent systems, this book offers a disciplined path: make state visible, keep evidence connected, grant autonomy precisely, and retain meaningful human control.…

- Brossura
- Print on Demand
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 16,37
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Print on Demand.

- Brossura
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 19,88
EUR 43,33 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibile
Paperback. Condizione: new. Paperback. An AI agent can complete a difficult task and still leave the next run with almost nothing useful. Plans, evidence, failed attempts, and decisions remain trapped in conversation history. Add more workers, and the problem becomes expensive duplication, weak coordination, and results that are hard to verify. Graph-Grounded Agents is a practical engineering playbook for turning temporary agent activity into connected, inspectable system state. Inside, you will learn how to: - build a bounded keep-or-reject improvement loop- represent tasks, artifacts, trials, claims, evaluations, and approvals- preserve experiment lineage without replaying full transcripts- assemble compact context bundles from relevant graph neighborhoods- divide multi-agent work without multiplying noise- evaluate both final artifacts and the actions used to create them- enforce provenance, permissions, budgets, and human gates- progress from one measured script to a production-ready architecture The book is framework-neutral. Its schemas, checklists, exercises, and 30-day plan can be implemented with files and Git, a relational database, a graph database, or a combination. For engineers and technical leads moving from impressive demos to reliable agent systems, this book offers a disciplined path: make state visible, keep evidence connected, grant autonomy precisely, and retain meaningful human control. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…