Tractability: Practical Approaches to Hard Problems | Agenda Bookshop Skip to content
LAST CHANCE! Order items marked '10-20 working days' TODAY to get them in time for Christmas!
LAST CHANCE! Order items marked '10-20 working days' TODAY to get them in time for Christmas!
Age Group_Uncategorized
Age Group_Uncategorized
automatic-update
B01=Lucas Bordeaux
B01=Pushmeet Kohli
B01=Youssef Hamadi
Category1=Non-Fiction
Category=UY
COP=United Kingdom
Delivery_Delivery within 10-20 working days
Language_English
PA=In stock
Price_€100 and above
PS=Active
softlaunch

Tractability: Practical Approaches to Hard Problems

English

Classical computer science textbooks tell us that some problems are 'hard'. Yet many areas, from machine learning and computer vision to theorem proving and software verification, have defined their own set of tools for effectively solving complex problems. Tractability provides an overview of these different techniques, and of the fundamental concepts and properties used to tame intractability. This book will help you understand what to do when facing a hard computational problem. Can the problem be modelled by convex, or submodular functions? Will the instances arising in practice be of low treewidth, or exhibit another specific graph structure that makes them easy? Is it acceptable to use scalable, but approximate algorithms? A wide range of approaches is presented through self-contained chapters written by authoritative researchers on each topic. As a reference on a core problem in computer science, this book will appeal to theoreticians and practitioners alike. See more
Current price €132.04
Original price €138.99
Save 5%
Age Group_Uncategorizedautomatic-updateB01=Lucas BordeauxB01=Pushmeet KohliB01=Youssef HamadiCategory1=Non-FictionCategory=UYCOP=United KingdomDelivery_Delivery within 10-20 working daysLanguage_EnglishPA=In stockPrice_€100 and abovePS=Activesoftlaunch
Delivery/Collection within 10-20 working days
Product Details
  • Weight: 930g
  • Dimensions: 178 x 253mm
  • Publication Date: 06 Feb 2014
  • Publisher: Cambridge University Press
  • Publication City/Country: United Kingdom
  • Language: English
  • ISBN13: 9781107025196

About

Lucas Bordeaux is a Senior Research Software Development Engineer at Microsoft Research Cambridge where he works on the design and applications of algorithms to solve hard inference problems. Youssef Hamadi is a Senior Researcher at Microsoft Research Cambridge. His work involves the practical resolution of large-scale real life problems set at the intersection of Optimization and Artificial Intelligence. His current research considers the design of complex systems based on multiple formalisms fed by different information channels which plan ahead and perform smart decisions. His current focus is on Autonomous Search Parallel Search and Propositional Satisfiability with applications to Environmental Intelligence Business Intelligence and Software Verification. Pushmeet Kohli is a Research Scientist in the Machine Learning and Perception group at Microsoft Research Cambridge. His research interests span the fields of Computer Vision Machine Learning Discrete Optimization Game Theory and Human-Computer Interaction with the overall aim of 'teaching' computers to understand the behaviour and intent of human users and to correctly interpret (or 'See') objects and scenes depicted in colour/depth images or videos. In the context of tractability and optimization Pushmeet has worked on developing adaptive combinatorial and message passing-based optimization algorithms that exploit the structure of problems to achieve improved performance.

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept