Search Theory

Regular price €248.00
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
Admiral Ernest King
advanced search algorithms
Age Group_Uncategorized
Age Group_Uncategorized
automatic-update
B01=David V. Chudnovsky
B01=Gregory V. Chudnovsky
Birkhoff Ergodic Theorem
Borel Subset
Bounded Borel Measurable Function
Category1=Non-Fiction
Category=PBK
Category=PBKF
Circular Domains
Continued Fraction Expansion
continuous detection strategies for scientists
COP=United Kingdom
Delivery_Pre-order
Detection Function
dynamic systems analysis
eq_isMigrated=2
eq_nobargain
Equivalent Dynamic System
Eulerian Graphs
game theory applications
Half Plane Problems
Hiding Point
Kronecker Theorem
Language_English
Lebesgue Measure
mathematical optimization
Moving Target Problems
Optimal Search
Optimal Search Strategy
Ordinary Differential Equation
PA=Temporarily unavailable
Price_€100 and above
probability modeling
PS=Active
Recurrence Theorem
Search Effort
Search Equations
Search Path
Search Plans
Search Problem
Search Trajectories
softlaunch
stochastic processes
Target Location Probability

Product details

  • ISBN 9781138441941
  • Weight: 490g
  • Dimensions: 178 x 254mm
  • Publication Date: 20 Nov 2017
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

Providing immediate access to modern search theory, state-of-the-art methods, related areas of mathematics and their techniques, and applications, this important reference surveys classical results and approaches to search theory as well as the latest procedures of optimal and nearly optimal search planning for the most detailed and comprehensive source on the subject.

Search Theory clearly describes the solution of an optimal search problem with an exponential detection function...covers one-and two-sided detection problems by furnishing continuous and discrete time strategies...examines two-sided search strategies with solutions in "hide and seek" games in many discrete and continuous bounded and unbounded domanins...presents a consistent framework for solving complex problems in a unified way by differential equations...discusses systematic means of generating tours for optimal search in bounded domains...and considers a novel class of random search plans.

David Chudnovsky is a Research Scientist in the Department of Mathematics at Columbia University in New York City, where he has served since 1978. Gregory V. Chudnovsky.