Youssef Hamadi – författare
Visar alla böcker från författaren Youssef Hamadi. Handla med fri frakt och snabb leverans.
12 produkter
Handbook of Parallel Constraint Reasoning
Av Youssef Hamadi, Lakhdar Sais
Häftad, 2019
1241 kr
Lägg i varukorg
This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements …
Handbook of Parallel Constraint Reasoning
Av Youssef Hamadi, Lakhdar Sais
Inbunden, 2018
1690 kr
Lägg i varukorg
This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements …
Handbook of Parallel Constraint Reasoning
Av Lakhdar Sais, Youssef Hamadi
E-bok, 2018
1622 kr
Lägg i varukorg
This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements …
Autonomous Search
Av Youssef Hamadi, Eric Monfroy m. fl.
Inbunden, 2012
1096 kr
Lägg i varukorg
Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to …
Autonomous Search
Av Frederic Saubion, Eric Monfroy m. fl.
E-bok, 2012
1459 kr
Lägg i varukorg
Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to …
Learning and Intelligent Optimization
6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers
Av Youssef Hamadi, Marc Schoenauer
Häftad, 2012
552 kr
Lägg i varukorg
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Conference on Learning and Intelligent Optimization, LION 6, held in Paris, France, in January 2012. The 23 long and 30 short revised papers were carefully reviewed and selected from a total of 99 …
Learning and Intelligent Optimization
6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers
Av Marc Schoenauer, Youssef Hamadi
E-bok, 2012
734 kr
Lägg i varukorg
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Conference on Learning and Intelligent Optimization, LION 6, held in Paris, France, in January 2012. The 23 long and 30 short revised papers were carefully reviewed and selected from a total of 99 …
Combinatorial Search: From Algorithms to Systems
Inbunden, 2013
568 kr
Lägg i varukorg
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space …
Combinatorial Search: From Algorithms to Systems
E-bok, 2013
734 kr
Lägg i varukorg
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space …
Autonomous Search
Av Youssef Hamadi, Eric Monfroy m. fl.
Häftad, 2014
1096 kr
Lägg i varukorg
Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to …
Combinatorial Search: From Algorithms to Systems
Häftad, 2016
552 kr
Lägg i varukorg
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space …
Tractability
Practical Approaches to Hard Problems
Av Lucas Bordeaux, Youssef Hamadi m. fl.
Inbunden, 2014
1962 kr
Tillfälligt slut
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 …
