null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Learning Automata (An Introduction)

List Price: $24.95
SKU:
9780486498775
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Kumpati S. Narendra, Mandayam A.L. Thathachar
    Format:
    Paperback
    Pages:
    496
    Publisher:
    Dover Publications (December 19, 2012)
    Language:
    English
    ISBN-13:
    9780486498775
    ISBN-10:
    0486498778
    Weight:
    23.2oz
    Dimensions:
    6.5" x 9"
    Case Pack:
    18
    Series:
    Dover Books on Electrical Engineering
    File:
    Dover-Dover_04092026_P9936991_onix30-20260408.xml
    Folder:
    Dover
    As low as:
    $23.70
    List Price:
    $24.95
    Publisher Identifier:
    P-DOVER
    Discount Code:
    D
    Audience:
    College/higher education
    Pub Discount:
    65
    Imprint:
    Dover Publications
  • Overview

    This self-contained introductory text on the behavior of learning automata focuses on how a sequential decision-maker with a finite number of choices responds in a random environment. Topics include fixed structure automata, variable structure stochastic automata, convergence, 0 and S models, nonstationary environments, interconnected automata and games, and applications of learning automata. A must for all students of stochastic algorithms, this treatment is the work of two well-known scientists and is suitable for a one-semester graduate course in automata theory and stochastic algorithms. This volume also provides a fine guide for independent study and a reference for students and professionals in operations research, computer science, artificial intelligence, and robotics. The authors have provided a new preface for this edition.