0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Buy Now

The Annealing Algorithm (Hardcover, 1989 ed.) Loot Price: R4,121
Discovery Miles 41 210
The Annealing Algorithm (Hardcover, 1989 ed.): R.H.J.M. Otten, L.P.P.P.Van Ginneken

The Annealing Algorithm (Hardcover, 1989 ed.)

R.H.J.M. Otten, L.P.P.P.Van Ginneken

Series: The Springer International Series in Engineering and Computer Science, 72

 (sign in to rate)
Loot Price R4,121 Discovery Miles 41 210 | Repayment Terms: R386 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

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."

General

Imprint: Springer
Country of origin: Netherlands
Series: The Springer International Series in Engineering and Computer Science, 72
Release date: June 1989
First published: 1989
Authors: R.H.J.M. Otten • L.P.P.P.Van Ginneken
Dimensions: 235 x 155 x 14mm (L x W x T)
Format: Hardcover
Pages: 202
Edition: 1989 ed.
ISBN-13: 978-0-7923-9022-0
Categories: Books > Professional & Technical > General
Books > Computing & IT > General theory of computing > General
Books > Computing & IT > Applications of computing > General
Promotions
LSN: 0-7923-9022-9
Barcode: 9780792390220

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Systems Analysis And Design In A…
John Satzinger, Robert Jackson, … Hardcover  (1)
R1,338 R1,245 Discovery Miles 12 450
Systems Analysis And Design
Scott Tilley Hardcover R1,356 R1,259 Discovery Miles 12 590
Oracle 12c - SQL
Joan Casteel Paperback  (1)
R1,376 R1,275 Discovery Miles 12 750
Foundations Of Computer Science
Behrouz Forouzan Paperback R1,247 R1,166 Discovery Miles 11 660
Discovering Computers - Digital…
Misty Vermaat, Mark Ciampa, … Paperback R1,315 R1,222 Discovery Miles 12 220
Introduction to Computer Theory
Daniel I. A. Cohen Paperback  (4)
R6,908 Discovery Miles 69 080
Discovering Computers 2018 - Digital…
Misty Vermaat, Steven Freund, … Paperback R1,136 Discovery Miles 11 360
Dynamic Web Application Development…
David Parsons, Simon Stobart Paperback R1,314 R1,221 Discovery Miles 12 210
Program Construction - Calculating…
Roland Backhouse Paperback R1,460 Discovery Miles 14 600
Introduction to the Theory of…
Michael Sipser Hardcover R1,326 R1,230 Discovery Miles 12 300
Foundations Of Computer Science
Behrouz Forouzan Paperback R1,000 R599 Discovery Miles 5 990
Distributed Systems - Concurrency and…
Matthieu Perrin Hardcover R1,821 Discovery Miles 18 210

See more

Partners