Algorithms And Ordering Heuristics For Distributed Constraint Satisfaction Problems

Algorithms And Ordering Heuristics For Distributed Constraint Satisfaction Problems

Algorithms And Ordering Heuristics For Distributed Constraint Satisfaction Problems

Spedizione: Standard

I nostri utenti amano

73,25€ da Mondadori Store

73,25€
Spedizione: Gratuita
Algorithms And Ordering Heuristics For Distributed Constraint Satisfaction Problems
73,25€
Spedizione: Gratuita

Storico prezzi

Algorithms And Ordering Heuristics For Distributed Constraint Satisfaction Problems

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.