Visit our Christmas Gift Finder
Click & Collect from 2 Hours*
Free Delivery to UK Shops
Free UK Standard Delivery On all orders £20 and over Free Delivery to UK Shops Local shops and expert booksellers nationwide Free Click & Collect to UK shops From 2 hours of your order*
The Complexity of Valued Constraint Satisfaction Problems - Cognitive Technologies (Paperback)
  • The Complexity of Valued Constraint Satisfaction Problems - Cognitive Technologies (Paperback)
zoom

The Complexity of Valued Constraint Satisfaction Problems - Cognitive Technologies (Paperback)

(author)
£101.00
Paperback 170 Pages / Published: 09/11/2014
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket

The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different contexts of discrete mathematics, computer science and artificial intelligence under different names: Min-Sum problems, MAP inference in Markov random fields (MRFs) and conditional random fields (CRFs), Gibbs energy minimisation, valued constraint satisfaction problems (VCSPs), and, for two-state variables, pseudo-Boolean optimisation.

In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques.

The book is suitable for researchers interested in methods and results from the area of constraint programming and discrete optimisation.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783642434563
Number of pages: 170
Weight: 297 g
Dimensions: 235 x 155 x 10 mm
Edition: 2012 ed.


MEDIA REVIEWS

From the reviews:

"The book is concerned with valued constraint satisfaction problems with finite domains, i. e., the problem of minimising the sum of functions that each depend on some subset of a finite set of discrete variables with finite domains. ... In all places the description is very precise and exact, detailed where needed. This makes it a very useful reference for researchers working in the field." (Thomas Jansen, zbMATH, Vol. 1283, 2014)

You may also be interested in...

The Lego Architect
Added to basket
£20.99
Hardback
Business Analysis Techniques
Added to basket
Schaum's Outline of Fluid Dynamics
Added to basket
Data Analysis with Open Source Tools
Added to basket
Pragmatic Guide to Git
Added to basket
Using Docker
Added to basket
£47.99
Paperback
Discrete Mathematics
Added to basket
Machine Learning
Added to basket
The Elements of Statistical Learning
Added to basket
Artificial Intelligence: The Basics
Added to basket
AQA A level Computer Science
Added to basket
The Singularity Is Near
Added to basket
Logic for Computer Science
Added to basket
Machine Learning
Added to basket
£37.99
Paperback
Introducing Artificial Intelligence
Added to basket

Please sign in to write a review

Your review has been submitted successfully.