Abstract-In a typical visual search experiment, observers look through a set of items for a designated target that may or may not be present. Reaction time (RT) is measured as a function of the number of items in the displayThe visual search paradigm has been a pillar of research in visual attention for more than 20 years. In a typical visual search experiment, observers are presented with a display containing a number of items. On each trial, the observers must determine if a specific target item is or is not present among the distractor items. The number of items ( set size ) varies from trial to trial. Experimenters measure the reaction time (RT), the amount of time that is required to make a "target-present" or "targetabsent" response. They also note the accuracy of that response. Changes in accuracy and RT as a function of set size constitute the preferred measures of search performance (for a review, see Wolfe, in press).The search paradigm is valuable because performance on these tasks varies in a systematic way with the nature of the search stimuli. For some tasks, performance does not depend on set size. For example, in a search for a red spot among green spots, the number of green spots is irrelevant. Accuracy will be high and RT fast for all set sizes. The slope of the RT × Set Size function will be near zero. The independence of RT and set size is consistent with parallel processing of all items. For other tasks, RT is a roughly linear function of set size. For example, in a search for an S among mirror-reversed S s, RTs will increase at a rate of approximately 20 to 30 ms/item for target-present trials and 40 to 60 ms/item for target-absent trials. The linear increase in RT and the 2:1 ratio between target-absent and target-present slopes is characteristic of a serial, self-terminating search, though it is also consistent with various limited-capacity (Townsend, 1971(Townsend, , 1990) and unlimited-capacity (Palmer & McLean, 1995) parallel search processes.In part because of results of this sort, searches have been divided into parallel searches, in which all items can be processed in a single step, and serial searches, in which attention is deployed from item to item until the target is found. Treisman and Gelade (1980) proposed that searches for basic features like color, motion, and orientation are parallel, whereas other searches, like those for S s among mirrorreversed S s, are serial. Further, they argued that conjunction searches fall into the serial category. These are searches in which the target is defined by two or more basic features. For example, the target might be a small blue item among big blue and small yellow items. Subsequent 0.research has shown that many conjunction searches are more efficient than would be predicted by a strictly serial search (e.g., Cohen, 1993;Cohen & Ivry, 1991;Dehaene, 1989;Egeth, Virzi, & Garbart, 1984;McLeod, Driver, & Crisp, 1988;McLeod, Driver, Dienes, & Crisp, 1991;Nakayama & Silverman, 1986;Sagi, 1988;Theeuwes & Kooi, 1994;Treisman & Sato, 1990;von d...