Benutzerdefiniertes Cover
Theory of optimal search / Lawrence D. Stone
Mitwirkende(r): Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: Mathematics in science and engineering ; v. 118Verlag: New York : Academic Press, 2010Beschreibung: Online Ressource (xiv, 260 pages) : illustrationsISBN:- 9780126724509
- 9780080956275
- 0080956270
- 0126724504
- 9780126724509
- 001.424
- 001.4/24
- T57.97
- QA3
Inhalte:
Zusammenfassung: In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank matPPN: PPN: 878889108Package identifier: Produktsigel: BSZ-33-EBS-C1UB | BSZ-33-EBS-HSAA | GBV-33-EBS-MRI | GBV-33-EBS-ZHB | GBV-33-Freedom-BL | ZDB-1-ELC | ZDB-33-EBS | ZDB-33-ESD
Front Cover; Theory of Optimal Search; Copyright Page; Contents; Preface; Acknowledgments; Introduction; Objectives; The Problem of Optimal Search; Example; Outline of Chapters; Chapter I. Search Model; 1.1. The Target Distribution; 1.2. Detection; 1.3. Basic Search Problem; Notes; Chapter II. Uniformly Optimal Search Plans; 2.1. Optimization by the Use of Lagrange Multipliers; 2.2. Uniformly Optimal Search Plans for Regular Detection Functions; 2.3. Optimal Search with Uncertain Sweep Width; 2.4. Uniformly Optimal Search Plans for the General Case; Notes
Chapter III. Properties of Optimal Search Plans3.1. An Interpretation of Lagrange Multipliers; 3.2. Maximum Probability Search; 3.3. Incremental Optimization; 3.4. Multiple Constraints; Notes; Chapter IV. Search with Discrete Effort; 4.1. Model for Search with Discrete Effort; 4.2. Uniformly Optimal Search Plans; 4.3. Minimizing Expected Cost to Find the Target; 4.4. Optimal Whereabouts Search; Notes; Chapter V. Optimal Search and Stop; 5.1. Optimal Search and Stop with Discrete Effort; 5.2. Optimal Search and Stop with Continuous Effort; Notes
Chapter VI. Search in the Presence of False Targets6.1. False-Target Models; 6.2. Criterion for Optimality; 6.3. Optimal Nonadaptive Plans; 6.4. Optimization Theorems; 6.5. Examples; 6.6. Semiadaptive Plans; Notes; Chapter VII. Approximation of Optimal Plans; 7.1. Approximations That Are Optimal in a Restricted Class; 7.2. Incremental Approximations; Notes; Chapter VIII. Conditionally Deterministic Target Motion; 8.1. Description of Search Problem; 8.2. Uniformly Optimal Plans When the Target Motion is Factorable; 8.3. Optimal Plans within ?(m1, 8, K)
8.4. Necessary and Sufficient Conditions for t-Optimal Search PlansNotes; Chapter IX. Markovian Target Motion; 9.1. Two-Cell Discrete-Time Markovian Motion; 9.2. Two-Cell Continuous-Time Markovian Motion; 9.3. Continuous-Time Markovian Motion in Euclidean N-Space; Notes; Appendix A: Reference Theorems; Appendix B: Necessary Conditions for Constrained Optimization of Separable Functionals; B.1. Necessary Conditions for the Discrete Space J; B.2. Necessary Conditions for the Continuous Space X; Notes; References; Author Index; Subject Index; Notation Index
Dieser Titel hat keine Exemplare
Restrictions unspecified star
Online-Ausg. [S.l.] : HathiTrust Digital Library
Online-Ausg. [S.l.] : HathiTrust Digital Library. Online-Ausg. [S.l.] : HathiTrust Digital Library
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.