An inefficient visual search task can be facilitated if half the distractor items are presented as a preview prior to the presentation of the remaining distractor items and target. This benefit in search is termed the preview effect . Recent research has found that a preview effect can still occur if the previewed items disappear before reappearing again just before the search items (the ‘‘top-...

We propose a class of decisive collective choice rules that rely on linear ordering to partition the majority relation into two acyclic relations. The first these relations is used pare down set feasible alternatives shortlist while second make final from shortlist. Rules in this are characterized by four properties: classical rationality requirements (Sen's Expansion Consistency and Manzini Ma...

We present a nested local search algorithm to approximate several variants of metric two-stage stochastic facility location problems. These problems are generalizations of the well-studied metric uncapacitated facility location problem, taking uncertainties in demand values and costs into account. The proposed nested local search procedure uses three facility operations: adding, dropping, and s...

The goal of this paper is to search for two-locus combinations that are jointly associated with rheumatoid arthritis using the data set of Genetic Analysis Workshop 16 Problem 1. We use a two-stage strategy to reduce the computational burden associated with performing an exhaustive two-locus search across the genome. In the first stage, the full set of 531,689 single-nucleotide polymorphisms wa...

This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson’s rule and on ...