000 | 03194nam a22003735i 4500 | ||
---|---|---|---|
001 | 306599 | ||
003 | MX-SnUAN | ||
005 | 20160429160045.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2012 gw | o |||| 0|eng d | ||
020 |
_a9783642339745 _99783642339745 |
||
024 | 7 |
_a10.1007/9783642339745 _2doi |
|
035 | _avtls000360385 | ||
039 | 9 |
_a201509031011 _bVLOAD _c201405070258 _dVLOAD _y201402201431 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aQA75.5-76.95 | |
100 | 1 |
_aŽivný, Stanislav. _eautor _9345919 |
|
245 | 1 | 4 |
_aThe Complexity of Valued Constraint Satisfaction Problems / _cby Stanislav Živný. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2012. |
|
300 |
_axvii, 170 páginas 23 ilustraciones _brecurso en línea. |
||
336 |
_atexto _btxt _2rdacontent |
||
337 |
_acomputadora _bc _2rdamedia |
||
338 |
_arecurso en línea _bcr _2rdacarrier |
||
347 |
_aarchivo de texto _bPDF _2rda |
||
490 | 0 |
_aCognitive Technologies, _x1611-2482 |
|
500 | _aSpringer eBooks | ||
505 | 0 | _aChap. 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 Conservative Languages -- Chap. 9 The Power of Linear Programming -- Chap. 10 Hybrid Tractability -- Chap. 11 Summary and Open Problems -- References -- Index. | |
520 | _aThe 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. | ||
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783642339738 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-33974-5 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c306599 _d306599 |