Pessimal guesses may be optimal: a counterintuitive search result

DOI10.1109/34.9117zbMath0663.68118OpenAlexW2135614598MaRDI QIDQ3814856

James Painter, Kenneth R. Sloan

Publication date: 1988

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/34.9117

zbMATH Keywords

dynamic programmingsurface reconstructionsearch

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

ON THE MATABILITY OF POLYGONS

This page was built for publication: Pessimal guesses may be optimal: a counterintuitive search result