By Topic

Pessimal guesses may be optimal: a counterintuitive search result

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. R. Sloan ; Dept. of Comput. Sci., Washington Univ., Seattle, WA, USA ; J. Painter

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

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:10 ,  Issue: 6 )