Articoli correlati a Tractability: Practical Approaches to Hard Problems
Sinossi
An overview of the techniques developed to circumvent computational intractability, a key challenge in many areas of computer science.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreCambridge University Press
- Data di pubblicazione2014
- ISBN 10 1107025192
- ISBN 13 9781107025196
- RilegaturaCopertina rigida
- LinguaInglese
- Numero di pagine396
- RedattoreBordeaux Lucas, Hamadi Youssef, Kohli Pushmeet
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 151,46
EUR 0,56 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiRisultati della ricerca per Tractability: Practical Approaches to Hard Problems
Foto dell'editore
Tractability
Editore:
Cambridge University Press, Cambridge, UK, 2014
ISBN 10: 1107025192
ISBN 13: 9781107025196
Antico o usato
Rilegato
Da: Florida Mountain Book Co., Datil, NM, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good+. Hardcover, [xxi], 377 pages. Good+ condition. Size 10"x7". "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." Book has moderate shelfwear, boards are bumped on extremities. Interior text is Near Fine, clean and unmarked. Codice articolo 009695
Quantità: 1 disponibili
Foto dell'editore
Tractability: Practical Approaches to Hard Problems
Editore:
Cambridge University Press, 2014
ISBN 10: 1107025192
ISBN 13: 9781107025196
Antico o usato
Rilegato
Da: Labyrinth Books, Princeton, NJ, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: Very Good. Codice articolo 161815
Quantità: 4 disponibili
Foto dell'editore
Tractability
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FM-9781107025196
Quantità: 1 disponibili
Foto dell'editore
Fundamentals of Electro-Optic Systems Design: Communications, Lidar, and Imaging
ISBN 10: 1107025192
ISBN 13: 9781107025196
Nuovo
Da: thebookforest.com, San Rafael, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010. Codice articolo 1LAGBP001YLC
Quantità: 1 disponibili
Foto dell'editore
Tractability
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 4 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FM-9781107025196
Quantità: 1 disponibili
Foto dell'editore
Tractability
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. pp. 396 75 Illus. Codice articolo 94866452
Quantità: 3 disponibili
Foto dell'editore
Tractability: Practical Approaches to Hard Problems
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 377 pages. 10.00x7.00x1.00 inches. In Stock. Codice articolo __1107025192
Quantità: 1 disponibili
Foto dell'editore
Tractability (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107025192
ISBN 13: 9781107025196
Nuovo
Rilegato
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. 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. Many computational problems cannot be solved efficiently according to classical computer science textbooks. Tractability gives a cross-disciplinary overview of the advanced techniques that have been developed in order to solve these 'hard' computational problems, and a unified presentation of the properties that can be exploited to make them tractable. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9781107025196
Quantità: 1 disponibili
Foto dell'editore
Tractability (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107025192
ISBN 13: 9781107025196
Nuovo
Rilegato
Da: Grand Eagle Retail, Fairfield, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. 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. Many computational problems cannot be solved efficiently according to classical computer science textbooks. Tractability gives a cross-disciplinary overview of the advanced techniques that have been developed in order to solve these 'hard' computational problems, and a unified presentation of the properties that can be exploited to make them tractable. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781107025196
Quantità: 1 disponibili
Foto dell'editore
Tractability (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2014
ISBN 10: 1107025192
ISBN 13: 9781107025196
Nuovo
Rilegato
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. 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. Many computational problems cannot be solved efficiently according to classical computer science textbooks. Tractability gives a cross-disciplinary overview of the advanced techniques that have been developed in order to solve these 'hard' computational problems, and a unified presentation of the properties that can be exploited to make them tractable. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9781107025196
Quantità: 1 disponibili