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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Bestandsnummer des Verkäufers 407516142
Anzahl: 3 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781032762661
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. Bestandsnummer des Verkäufers 18406686779
Anzahl: 3 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. Bestandsnummer des Verkäufers 26406686769
Anzahl: 3 verfügbar
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781032762661
Anzahl: 1 verfügbar