Tournament of Books 2015
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Required Reading | January 16, 2015

    Required Reading: Books That Changed Us



    We tend to think of reading as a cerebral endeavor, but every once in a while, it can spur action. The following books — ranging from... Continue »

    spacer

The Complexity of Valued Constraint Satisfaction Problems (Cognitive Technologies)

The Complexity of Valued Constraint Satisfaction Problems (Cognitive Technologies) Cover

 

Synopses & Reviews

Publisher Comments:

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

Synopsis:

This book presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs). It is an ideal resource for researchers in constraint programming and discrete optimisation.

About the Author

Dr. Stanislav Živný has a Ph.D. in Computer Science from the University of Oxford, and he

Table of Contents

Chap. 1 Introduction.- Chap. 2 Background.- Chap. 3 Expressibility of Valued Constraints.- Chap. 4 Expressibility of Fixed-Arity Languages.- Chap. 5 Expressibility of Submodular Languages.- Chap. 6 Non-expressibility of Submodular Languages.- Chap. 7 Tractable Languages.- Chap. 8

Product Details

ISBN:
9783642339738
Publisher:
Springer
Subject:
Computer Science
Author:
Živný, Stanislav
Author:
Živný, Stan
Author:
Ivn, Stan
Subject:
Algorithms
Subject:
Constraint programming (CP)
Subject:
Constraint satisfaction problem (CSP)
Subject:
Discrete Optimization
Subject:
Linear programming (LP)
Subject:
Tractability
Subject:
Tractable languages
Subject:
Valued Constraint satisfaction problems (VCSPs)
Subject:
Theory of computation
Subject:
Artificial Intelligence (incl. Robotics)
Subject:
Mathematical Logic and Foundations
Subject:
Mathematics of Computing
Subject:
Computers-Reference - General
Copyright:
Edition Description:
2012
Series:
Cognitive Technologies
Publication Date:
20121130
Binding:
HARDCOVER
Language:
English
Pages:
187
Dimensions:
235 x 155 mm

Related Subjects

Computers and Internet » Artificial Intelligence » General
Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Science and Mathematics » Agriculture » General
Science and Mathematics » Mathematics » Computer

The Complexity of Valued Constraint Satisfaction Problems (Cognitive Technologies)
0 stars - 0 reviews
$ In Stock
Product details 187 pages Springer - English 9783642339738 Reviews:
"Synopsis" by , This book presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs). It is an ideal resource for researchers in constraint programming and discrete optimisation.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.