In some cases we may not want to examine all data values, because the dataset is so large. In this case, we can employ search techniques for finding criticalities. Beginning at any point, we can follow steepest ascent to reach a criticality. The search methods will employ a variety of techniques, inspired by the distributed representation and potential field approaches to robot motion planning ([20], [19], [21], [22], [23]).