Kapcsolat
Hogyan vásároljunk
Kézbesítés
Vásárlási tanácsadó
The Annealing Algorithm
Angol
437 b
Akár 30 napos visszaküldési lehetőség
A vásárlók ilyet vásároltak
/
Puha kötésű
12 671
Ft
/
Puha kötésű
17 566
Ft
/
Kemény kötésű
3 413
Ft
/
Puha kötésű
17 566
Ft
/
Puha kötésű
41 837
Ft
The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem. All that is needed to run annealing on such a problem is a unique representation for each configuration, a procedure for measuring its quality, and a neighbor relation. Much more is needed however for obtaining acceptable results consistently in a reasonably short time. It is even doubtful whether the problem can be formulated such that annealing becomes an adequate approach for all instances of an optimization problem. Questions such as what is the best formulation for a given instance, and how should the process be controlled, have to be answered. Although much progress has been made in the years after the introduction of the concept into the field of combinatorial optimization in 1981, some important questions still do not have a definitive answer. In this book the reader will find the foundations of annealing in a self-contained and consistent presentation. Although the physical analogue from which the con cept emanated is mentioned in the first chapter, all theory is developed within the framework of markov chains. To achieve a high degree of instance independence adaptive strategies are introduced.
Információ a könyvről
Angol
Ajándékozza oda ezt a könyvet még ma
Nagyon egyszerű
1 Tegye a kosárba könyvet, és válassza ki a kiszállítás ajándékként opciót 2 Rögtön küldjük Önnek az utalványt 3 A könyv megérkezik a megajándékozott címéreEzt is ajánljuk
Szia! Libroamiko vagyok, a könyvtanácsadód.
Miben segíthetek?