Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

SODA
2010
ACM

favoriteEmaildiscussreport

232views Algorithms» more SODA 2010»

On the Optimality of Spiral Search

14 years 1 months ago

On the Optimality of Spiral Search

Download web.informatik.uni-bonn.de

Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competitive ratio of 17.289.. . It was shown by Gal [7] that this strategy is the best strategy among all monotone and periodic strategies. Since then it was unknown whether the given strategy is optimal in general. This paper settles this old open problem and shows that spiral search is indeed optimal.

Elmar Langetepe

Real-time Traffic

Discrete Algorithms | Search Game Problem | Search Strategy | SODA 2010 | Spiral Search |

claim paper

Related Content

» Color Image Compression with Modified Fractal Coding on Spiral Architecture

» PerformanceEnergy Optimization of DSP Transforms on the XScale Processor

» Optimization of Integrated Spiral Inductors Using Sequential Quadratic Programming

» SPIRAL efficient and exact model identification for hidden Markov models

» System Demonstration of Spiral Generator for HighPerformance Linear Transform Libraries

» A Language for the Compact Representation of Multiple Program Versions

» Experience of Optimizing FFT on Intel Architectures

» Optimizing Sorting with Genetic Algorithms

» SPIRAL out of convexity sparsityregularized algorithms for photonlimited imaging

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Elmar Langetepe

Comments (0)