The problems of search, exploration, discovery, and identification are of key importance in a wide variety of applications, including engineering, computer science, economics, and information theory. Over the past 30 years a great deal of work has been done on search problems by scientists from seve
Search Problems (Wiley Interscience Series in Discrete Mathematics)
β Scribed by Rudolf Ahlswede
- Publisher
- John Wiley & Sons Inc
- Year
- 1987
- Tongue
- English
- Leaves
- 149
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
The problems of search, exploration, discovery and identification are of key importance in a wide variety of applications. This book provides a comprehensive survey of the substantial contributions made to these problems by researchers in the last 30 years. The authors emphasise connections to other fields such as stochastic approximation, information theory, statistics and operations research. The first part of the book gives a thorough and detailed introduction to the subject, covering the more elementary search problems. The second half is intended to provide a guide to the various methods available for scientific researchers faced with more complex problems.
π SIMILAR VOLUMES
The problems of search, exploration, discovery, and identification are of key importance in a wide variety of applications, including engineering, computer science, economics, and information theory. Over the past 30 years a great deal of work has been done on search problems by scientists from seve
A mathematical gemβfreshly cleaned and polishedThis book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create
I happen to love studying probability theory and the probabilistic method and this is the book I come to time and time again. It is well organized and provides great, straightforward, insightful explanations. However, its main strength is its wealth of beautiful (fairly recently) results (in varied
Describes the combinatorial analysis of data using trees as the model, and the use of this model in representing proximities. This technique is of great importance in many applications including such fields as computer science, decision theory, artificial intelligence, information theory, experiment