[Home ]    
Main Menu
Home::
Introduction to OR ::
Introduction to Society::
Structure::
News & events::
Memebership::
Cantact us::
Web Facilities::
Journal::
::
Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
Book Intro
Book Treasure
:: Mathematical optimization: ::
The Complexity of Valued Constraint Satisfaction Problems
Author Stanislav Živný Translator
Publisher Springer-Verlag Berlin Heidelberg Publish Date 2012
Publish Time Pages Number 170
Cost Poster admin
Cover type Size
DOI Code Dewey Code
LC Code File -
Description
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 computer science and artificial intelligence under different names: Min-Sum Problems, inference in Markov Random Fields (MRFs) and Conditional Random Fields (CRFs), Gibbs energy minimisation, valued constraint satisfaction problems (VCSPs), and (for twostate variables) pseudo-Boolean optimisation. We present general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem.
Average: 4.66
Rate numbers: 3



Rate the book
EXCELLENT
VERYGOOD
GOOD
REGULAR
BAD

Back to book treasure homepage | Back to selected book topic

انجمن ایرانی تحقیق در عملیات Iranian Operations Research Society
Persian site map - English site map - Created in 0.043 seconds with 799 queries by yektaweb 3531