Pessimal guesses may be optimal: a counterintuitive search result
Sloan, K.R.
Painter, J.
Dept. of Comput. Sci., Washington Univ., Seattle, WA;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Nov 1988
Volume: 10,
Issue: 6
On page(s): 949-955
ISSN: 0162-8828
References Cited: 13
CODEN: ITPIDJ
INSPEC Accession Number: 3322974
Digital Object Identifier: 10.1109/34.9117
Current Version Published: 2002-08-06
Abstract
A particular style of search is considered that is motivated by
the problem of reconstructing the surface of three-dimensional objects
given a collection of planar contours representing cross-sections
through the objects. An improvement on the simple divide-and-conquer
method is presented. The key idea is to locate bottlenecks (minimal
separators), which markedly reduces the number of searches required but
reduces other measures (e.g. nodes expanded) by only a constant factor.
It is observed that for well-behaved search spaces, the search
efficiency can be improved further by making `pessimal guesses'. This
suggests a style of search in which the region of the search space
thought to be close to the optimal solution (on whatever grounds are
available) is examined last, while the outlying regions (the pessimal
guesses) are examined first
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
