Heuristics embodying limited information search and noncompensatory processing of information can yield robust performance relative to computationally more complex models. One criticism raised against heuristics is the argument that complexity is hidden in the calculation of the cue order used to make predictions. We discuss ways to order cues…

This dissertation explores the use of geometric and graphical models for a variety of information search and filtering applications. These models serve to provide an intuitive understanding of the problem domains and as well as computational efficiencies to our solution approaches. We begin by considering a search and rescue scenario where both…

Sixty-three college students worked with a computer simulation in which gradually increasing model complexity (model progression), model progression plus small assignments, or a control condition without either were used. Definition knowledge increased for all three conditions, but intuitive knowledge gain was greater for the two experimental…