"Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms."

U. K. Sarkar et al. (1989)

> Home

Details and statistics

DOI: 10.1007/BFB0018402

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/kbcs/SarkarCGD89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kbcs/SarkarCGD89
U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar:
Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms. KBCS 1989: 451-461

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.