Simulated Annealing and Boltzmann Machines : A Stochastic Approach to Combinatorial Optimization and Neural Computing (Wiley-interscience Series in D)

個数:
  • ポイントキャンペーン

Simulated Annealing and Boltzmann Machines : A Stochastic Approach to Combinatorial Optimization and Neural Computing (Wiley-interscience Series in D)

  • 提携先の海外書籍取次会社に在庫がございます。通常2週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • ≪洋書のご注文につきまして≫ 「海外取次在庫あり」および「国内仕入れ先からお取り寄せいたします」表示の商品でも、納期の目安期間内にお届けできないことがございます。あらかじめご了承ください。

  • 製本 Hardcover:ハードカバー版/ページ数 200 p.
  • 言語 ENG
  • 商品コード 9780471921462
  • DDC分類 519

基本説明

Contents: Simulated Annealing. Combinatorial Optimization. Simulated Annealing. Asymptotic Convergence. Finite-time Approximation. Simulated Annealing in Practice. Prarallel Simulated Annealing Algorithms. Boltzmann Machines. Neural Computing, and more.

Full Description


Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures. It is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide applicability of its evolving techniques point to the rapidity with which the field is moving from its beginnings to maturity and presage the ever-increasing interaction between it and computer science. The Series provides a broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, mathematical programming and the analysis of algorithms, and including such topics as Ramsey theory, transversal theory, block designs, finite geometries, Polya theory, graph and matroid algorithms, network flows, polyhedral combinatorics and computational complexity. The Wiley - Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of this extraordinary development.Recent titles in the Series: Search Problems Rudolf Ahlswede, University of Bielefeld, Federal Republic of Germany Ingo Wegener, Johann Wolfgang Goethe University, Frankfurt, Federal Republic of Germany The problems of search, exploration, discovery and identification are of key importance in a wide variety of applications. This book will be of great interest to all those concerned with searching, sorting, information processing, design of experiments and optimal allocation of resources. 1987 Introduction to Optimization E. M. L. Beale FRS, Scicon Ltd, Milton Keynes, and Imperial College, London This book is intended as an introduction to the many topics covered by the term 'optimization', with special emphasis on applications in industry. It is divided into three parts. The first part covers unconstrained optimization, the second describes the methods used to solve linear programming problems, and the third covers nonlinear programming, integer programming and dynamic programming. The book is intended for senior undergraduate and graduate students studying optimization as part of a course in mathematics, computer science or engineering. 1988

Table of Contents

SIMULATED ANNEALING.
Combinatorial Optimization.
Simulated Annealing.
Asymptotic Convergence.
Finite-Time Approximation.
Simulated Annealing in Practice.
Parallel Simulated Annealing Algorithms.
BOLTZMANN MACHINES.
Neural Computing.
Boltzmann Machines.
Combinatorial Optimization and Boltzmann
Machines.
Classification and Boltzmann Machines.
Learning and Boltzmann Machines.
Appendix.
Bibliography.
Indices.