微信服务号

微信订阅号

Home > Archive>Volume 12, Issue 12, 2001 >1748-1751
PDF HTML XML Export Cite reminder
Some Results on Optimal Search in Discrete Spaces
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    In this paper the searching problem for an object in a set of N locations is considered. The goal is to allocate the resources so as to maximize the probability of locating the object. By using Lagrangian operator method the problem of optimal search with the unknown target distribution is studied. Some selection criteria and error estimate results are derived.

    Reference
    Related
    Cited by
Get Citation

朱清新,周明天,John Oommen.关于离散空间中最优搜索策略的一些结果.软件学报,2001,12(12):1748-1751

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 12,2000
  • Revised:May 09,2001
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063