Tractability: Practical Approaches to Hard Problems

ISBN 10: 1107025192 / ISBN 13: 9781107025196

Editore: Cambridge University Press, 2014

Riguardo questo articolo

Codice articolo 161815

Dati bibliografici

Titolo: Tractability: Practical Approaches to Hard ...

Casa editrice: Cambridge University Press

Data di pubblicazione: 2014

Legatura: Rilegato

Condizione: Very Good

Descrizione articolo

Riassunto:

An overview of the techniques developed to circumvent computational intractability, a key challenge in many areas of computer science.

Informazioni sugli autori:

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.