ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Best first search in and/or graphs
Full text PdfPdf (395 KB)
Source ACM Annual Computer Science Conference archive
Proceedings of the 1988 ACM sixteenth annual conference on Computer science table of contents
Atlanta, Georgia, United States
Pages: 256 - 261  
Year of Publication: 1988
ISBN:0-89791-260-8
Authors
P. P. Chakrabarti  Department of Computer Science & Engg., Indian Institute of Technology, Kharagpur 721302, India
S. Ghose  Department of Computer Science & Engg., Indian Institute of Technology, Kharagpur 721302, India
S. C. DeSarkar  Department of Computer Science & Engg., Indian Institute of Technology, Kharagpur 721302, India
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322609.322650
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Bagchi and P.K. Srimani: "Weighted Heuristic Search in Networks", Journal of Algorithms 6, (1985) pp. 550-576.
2
A. Bagchi , A. Mahanti, Search Algorithms Under Different Kinds of Heuristics—A Comparative Study, Journal of the ACM (JACM), v.30 n.1, p.1-21, Jan. 1983  [doi>10.1145/322358.322359]
 
3
A. Bag~hi and A. Mahanti: "Admissible heuristi~ ~searah~in AND/OR graph", Theoretical Computer Science 24, 2 (July 1983) pp. 207-219.
4
Rina Dechter , Judea Pearl, Generalized best-first search strategies and the optimality af A*, Journal of the ACM (JACM), v.32 n.3, p.505-536, July 1985  [doi>10.1145/3828.3830]
5
A. Mahanti , A. Bagchi, AND/OR graph heuristic search methods, Journal of the ACM (JACM), v.32 n.1, p.28-51, Jan. 1985  [doi>10.1145/2455.2459]
 
6
A. Martelli and U. Montanari. "Additive AND/OR graphs", in Pro~. of 3rd Int. Joint Conf. on Al(Stanford, Calif. Aug. 1973) pp. I-ii.
7
Alberto Martelli , Ugo Montanari, Optimizing decision trees through heuristically guided search, Communications of the ACM, v.21 n.12, p.1025-1039, Dec. 1978  [doi>10.1145/359657.359664]
 
8
Laszlo Mero, A heuristic search algorithm with modifiable estimate, Artificial Intelligence, v.23 n.1, p.13-27, May 1984  [doi>10.1016/0004-3702(84)90003-1]
 
9
Dana S. Nau , Vipin Kumar , Laveen Kanal, General branch and bound, and its relation to A* and AO*, Artificial Intelligence, v.23 n.1, p.29-58, May 1984  [doi>10.1016/0004-3702(84)90004-3]
 
10
N. J. Nilsson, Principles of artificial intelligence, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1980
 
11
Judea Pearl, Heuristics: intelligent search strategies for computer problem solving, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1984

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Algorithms, Design, Measurement, Performance, Theory, Verification

Collaborative Colleagues:
P. P. Chakrabarti: colleagues
S. Ghose: colleagues
S. C. DeSarkar: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player