This book presents an entire dialogue on the sector of distributed constraints, its algorithms and its energetic evaluation areas. The correctly outlined model of distributed constraints satisfaction and optimization (DisCSPs/DisCOPs) can perform the thought for the design and investigation of distributed search algorithms, of protocols and of negotiations and search. The book introduces distributed constraint satisfaction and optimization points and describes the underlying model. Presenting a whole state-of-the-artwork in DisCSP and DisCOP evaluation, the subsequent topics are explored: – Households of search algorithms on DisCSPs and DisCOPs; – Distributed constraint optimization; – Ordering Heuristics for DisCSP algorithms; – Effectivity measures; – Affect of communication high high quality on distributed search; – Privateness factors; – Non exhaustive search algorithms on DisCSPs; – Functions of DisCSPs. This thorough exposition of the varied elements of distributed search algorithms for DisCSPs and DisCOPs is usually a helpful study for every researchers and practitioners.