This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in previous publications. The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Maurice Clerc is a French mathematician. He worked in the Research and Development Department of France Télécom. Retired since 2004, he remains active in various fields of research, both in particle swarm optimization (PSO)-related fields and in other areas. He regularly publishes articles, gives keynote speeches in conferences, serves as a director and thesis jury, and occasionally works as an optimization consultant.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. N° de réf. du vendeur 407516142
Quantité disponible : 3 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Paperback. Etat : new. Paperback. This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in previous publications.The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method. This study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781032762661
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. N° de réf. du vendeur 18406686779
Quantité disponible : 3 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26406686769
Quantité disponible : 3 disponible(s)
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Paperback. Etat : new. Paperback. This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in previous publications.The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method. This study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9781032762661
Quantité disponible : 1 disponible(s)