Combinatorial Search: From Algorithms to Systems - Hamadi, Youssef
- Format: Broché
- 156 pages Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtreLivre de poche,Expédition depuis la Chine; Livraison sous 8-12 jours
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Combinatorial Search: From Algorithms To Systems Format Broché - Livre Informatique
0 avis sur Combinatorial Search: From Algorithms To Systems Format Broché - Livre Informatique
Donnez votre avis et cumulez 5
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
-
A Likely Lad
Neuf dès 32,85 €
Occasion dès 12,00 €
-
Understanding Understanding
Neuf dès 30,77 €
Occasion dès 278,99 €
-
The Main
Neuf dès 22,04 €
Occasion dès 34,99 €
-
Volllust | 22 Erotische Geschichten
Neuf dès 18,97 €
Occasion dès 47,99 €
-
Heretics Of Dune
Occasion dès 28,99 €
-
Spanish Classics For Guitar In Tablature
Neuf dès 19,43 €
Occasion dès 59,99 €
-
Nightmares In The Sky: Gargoyles And Grotesques
Occasion dès 25,00 €
-
Saturnine
2 avis
Neuf dès 15,64 €
Occasion dès 34,99 €
-
$100m Offers Summary And Workbook: How To Make Offers So Good People Feel Stupid Saying No
Occasion dès 14,30 €
-
Douglas Propliners: Dc-1 To Dc-7
1 avis
Occasion dès 12,00 €
-
Babars French Lessons (Babar Books)
Occasion dès 24,69 €
-
The Trigger Point Therapy Workbook: Your Self -Treatment Guide For Pain Relief: Your Self-Treatment For Pain Relief
Occasion dès 30,68 €
-
Complete Japanese Joinery : A Handbook Of Japanese Tool Use And Woodworking For Joiners And Carpenters
Neuf dès 27,67 €
Occasion dès 316,99 €
-
Una Grammatica Italiana Per Tutti 2 - Regole D'uso, Esercizi E Chiavi Per Studenti Stranieri - Volume 2: Livello Intermedio
1 avis
Occasion dès 16,74 €
-
Cien Años De Soledad
6 avis
Occasion dès 11,99 €
-
La Bible En 365 Jours: Plan De Lecture Chronologique (Lire La Bible) (French Edition)
Occasion dès 16,00 €
-
Influence, New And Expanded Uk
Neuf dès 30,61 €
Occasion dès 21,29 €
-
Impossible
Neuf dès 26,12 €
Occasion dès 15,88 €
-
Halloween Night Ii (Point Horror Series)
Occasion dès 26,99 €
-
Warriors: Battles Of The Clans
Neuf dès 22,78 €
Occasion dès 14,77 €
Produits similaires
Présentation Combinatorial Search: From Algorithms To Systems Format Broché
- Livre InformatiqueAuteur(s) : Hamadi, YoussefEditeur : Springer-Verlag GmbhLangue : AnglaisParution : 01/08/2016Format : Moyen, de 350g à 1kgNombre de pages : 156Expédition : 248Dimensions : 23.5 x 15.5 x...
Résumé :
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 to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes. In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and communicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance ? this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.
Biographie:
Dr. Youssef Hamadi is the head of the Constraint Reasoning Group at Microsoft Research Cambridge, and his research interests include combinatorial optimization in alternative frameworks (parallel and distributed architectures); the application of machine learning to search; autonomous search; and parallel propositional satisfiability.
Sommaire:
Chap. 1 - Introduction.- Chap. 2 - Boosting Distributed Constraint Networks.- Chap. 3 - Parallel Tree Search for Satisfiability.- Chap. 4 - Parallel Local Search for Satisfiability.- Chap. 5 - Learning Variables Dependencies.- Chap. 6 - Continuous Search.- Chap. 7 - Autonomous Search.- Chap. 8 - Conclusion and Perspectives.
Détails de conformité du produit
Personne responsable dans l'UE