|
|
|
|
|
 |
Mathematical optimization:
|  |
|
| The Complexity of Valued Constraint Satisfaction Problems |
| مولف |
Stanislav Živný |
|
|
| ناشر |
Springer-Verlag Berlin Heidelberg |
تاریخ انتشار |
2012 |
| نوبت چاپ |
|
تعداد صفحات |
170 |
| قیمت پشت جلد |
|
ارسال کننده |
admin |
| نوع جلد |
|
اندازه |
|
| کد DOI |
|
کد دیویی |
|
| کد ال سی |
|
فایل کتاب |
- |
|
|
|
توضیح
|
|
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.
|
|
میانگین امتیازات: 4.5
تعداد آرا: 4
امتیاز دهید:
|
|
|
برگشت به صفحه اول گنجینه کتاب | برگشت به بخش قبلى
|
|
|
|
|
|
|
|
|
|
