商品簡介
Most of this book will deal with optimal one-sided search. In a one-sided search, the target can move but it does not react to the search. Optimal Search is simply the search for the best path to a specific goal, no matter what the goal is. It can be finding a missing airliner or ship, a survivalist suspected in the death of a police officer, the shortest route between several points (the Traveling Salesman Problem, e.g.), or the solution to inventory replenishment. The final chapter will present an overview of optimal two-sided search. In this type of search, the target can react to the searcher. It may react in a way to avoid detection, or it may try to “cooperate” with the searcher in attempting to be found by or to rendezvous with the searcher.
This book is a sequel to the Theory of Optimal Search (TOS) which was first published in 1975. TOS dealt extensively with the stationary target problem, but contained few results for moving targets. This reflected the state of knowledge at the time the book was published. Starting in the late 1970s, work by Brown, Washburn, and Stone produced a remarkably complete theory for finding optimal one-sided search plans. As well as characterizing optimal plans, the theory yielded methods for computing optimal search plans that are easily implemented on present day computers.
作者簡介
您曾經瀏覽過的商品
購物須知
外文書商品之書封，為出版社提供之樣本。實際出貨商品，以出版社所提供之現有版本為主。部份書籍，因出版社供應狀況特殊，匯率將依實際狀況做調整。
無庫存之商品，在您完成訂單程序之後，將以空運的方式為你下單調貨。為了縮短等待的時間，建議您將外文書與其他商品分開下單，以獲得最快的取貨速度，平均調貨時間為1~2個月。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。