Display repetitions do not improve search efficiency in parallel search tasks.
نویسندگان
چکیده
منابع مشابه
Parallel Efficiency for Graph Search
Cloud computing is offering utility oriented IT services to users worldwide. It enables hosting of applications from consumer, scientific and business domains. However data centers hosting cloud computing applications consume huge amounts of energy, contributing to high operational costs and carbon footprints to the environment. With the increasingly ubiquitous nature of Social Networks and Soc...
متن کاملBalanced Distributed Search Trees Do Not Exist
This paper is a rst step towards an understanding of the inherent limitations of distributed data structures. We propose a model of distributed search trees that is based on few natural assumptions. We prove that any class of trees within our model satis es a lower bound of (pm) on the worst case height of distributed search trees for m keys. That is, unlike in the single site case, balance in ...
متن کاملFace adaptation does not improve performance on search or discrimination tasks.
The face adaptation effect, as described by M. A. Webster and O. H. MacLin (1999), is a robust perceptual shift in the appearance of faces after a brief adaptation period. For example, prolonged exposure to Asian faces causes a Eurasian face to appear distinctly Caucasian. This adaptation effect has been documented for general configural effects, as well as for the facial properties of gender, ...
متن کاملWatching subgraphs to improve efficiency in maximum clique search
This paper describes a new technique referred to as watched subgraphs which improves the performance of BBMC, a leading state of the art exact maximum clique solver (MCP). It is based on watched literals employed by modern SAT solvers for boolean constraint propagation. In efficient SAT algorithms, a list of clauses is kept for each literal (it is said that the clauses 'watch the literal) so th...
متن کاملParallel Local Search to schedule communicating tasks on identical processors
The paper reports on the analysis of parallelization strategies for Local Search (LS) when the neighborhood size varies throughout the search, the Multiprocessor Scheduling Problem with Communication Delays (MSPCD) illustrating the methodology and results. The dynamic load distribution strategy implemented within a master-slave framework is shown to offer the best performance. Experimental resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2018
ISSN: 1534-7362
DOI: 10.1167/18.10.524