The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning by Reuven Y. Rubenstein, Reuven Y. Rubinstein, Dirk P. Kroese

BUY IT NEW

  • $104.00 Online Price
    $83.20 Member price
    (Save 20%)
    Limited Time Offer! Everyone receives the Member Price on books.
    See Details
  • skip to cart
  • Add To List uiAction=GetAllLists&page=List&pageType=list&ean=9780387212401&productCode=BK&maxCount=100&threshold=3

GET FREE SHIPPING ON ORDERS OF $25 OR MORE

DELIVERY & GIFT DETAILS:

Usually ships within 24 hours

Delivery Time and Shipping Rates

Eligible for gift wrap & gift message.

BUY IT USED

6 copies from $67.60

See All Available

(Other Format)

  • Pub. Date: July 2004
  • 300pp
    Buy it Used: 6 copies from $67.60 See All Available

    Customers who bought this also bought

     
    • Overview
    • Editorial Reviews
    • Features

    Product Details

    • Pub. Date: July 2004
    • Publisher: Springer-Verlag New York, LLC
    • Format: Other Format, 300pp

    Synopsis

    This book is a comprehensive and accessible introduction to the

    cross-entropy (CE) method. The book is based on an advanced undergraduate course on the CE

    method, given at the Israel Institute of Technology (Technion) for the

    last three years. It is aimed at a broad audience of engineers,

    computer scientists, mathematicians, statisticians and in general

    anyone, theorist and practitioner, who is interested in smart

    simulation, fast optimization, learning algorithms, image processing,

    et cetera.

    The aim of this book to is to present a text in which the CE method which was accessible to

    advanced undergraduate students and engineers who simply want to apply

    the CE method in their work, while at the same time accentuating the

    unifying and novel mathematical ideas behind the CE method, so as to

    stimulate further research at a post-graduate level.

    The emphasis in this book is placed on concepts rather than on

    mathematical completeness.

    Customer Reviews

    • Reader Rating:
    Be the first to write a review!