ISBN: 9783642339738 - the complexity of valued constraint satisfaction problems (8 risultati)

Condizione: New. pp. 190.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condizione: new. Questo è un articolo print on demand.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 188 pp. Englisch.…

Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents general methods for analysing the complexity of optimisation problems cast as valued constraint satisfaction problems (VCSPs) Suitable for researchers interested in methods and results from the area of constraint programming and discrete .…

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 188 pp. Englisch.…

Condizione: New. Print on Demand pp. 190 23 Illus.

Condizione: New. PRINT ON DEMAND pp. 190.