Why does it always seem to take so long to find anything? In this talk, we will look at some geometric and graph searching problems in an attempt to find out. (Assuming, that is, I can figure out where I left my car keys first.) On the real line we consider the following search problem: Starting at the origin, we are to find an unknown point p, by finding a search algorithm S (a map from [0, \infty) to (-\infty, \infty)) which minimizes the relative time required to reach p (i.e. minimizes the ratio (min S^{-1}(p))/|p|). We will find an algorithm which achieves a ratio of 9 and prove it is optimal (yep, lower bound = upper bound). (Results by Baeza-Yates, Culberson and Rawlins.) Then on graphs whose distances satisfy the triangle inequality, we consider the minimum (average or total) latency problem: Find a tour T which minimizes the average value of l(i), the latency of (time required to reach) node i. Using methods inspired by the previous result, we will define an algorithm which is no worse than 144 times the optimum. Not satisfied with this impressive result, we will indicate how the ratio has since been improved to less than 10. (Results by Blum et al.)