Results 21 to 30 of about 31,167 (325)
Search, Screening and Sorting [PDF]
We examine how search frictions impact labor market sorting by constructing a model consistent with evidence that employers interview a subset of a pool of applicants. We derive necessary and sufficient conditions for sorting in applications and matches. Positive sorting is obtained when production complementarities outweigh a counterforce measured by
Cai, Xiaoming +2 more
openaire +5 more sources
On-The-Job Search and Sorting [PDF]
We characterize the equilibrium of a search model with a continuum of job and worker types, wage bargaining, free entry of vacancies and on-the-job search. The decentralized economy with monopsonistic wage setting yields too many vacancies and hence too low unemployment compared to first best. This is due to a business-stealing externality.
Pieter A. Gautier +2 more
openaire +7 more sources
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors [PDF]
We provide and study several algorithms for sorting an array of n comparable distinct elements subject to probabilistic comparison errors. In this model, the comparison of two elements returns the wrong answer according to a fixed probability, p_e < 1/2,
Afshar, Ramtin +3 more
core +1 more source
A note on limits of sequences of binary trees [PDF]
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the ...
Rudolf Grübel
doaj +1 more source
Personalization Sorting Algorithm Based on Interest Attenuation [PDF]
The most currentranking algorithm don’t take users’ interest drifting over time into consideration,which affects the sorting quality.In order to solve this problem,a method ranking algorithm merging user interest attenuation is proposed.In this method ...
WANG Lin,LIU Jiyuan,MA Anjin
doaj +1 more source
AIT-S for Single-Machine Weighted Tardiness Problem [PDF]
This paper concentrates on the newly improved algorithm for solving the single-machine total weighted tardiness (SMTWT) problem, called Algorithm Inspired by Tree and Sorting (AIT-S).
Kacper Petrynski +3 more
doaj +1 more source
A threshold‐based sorting algorithm for dense wireless sensor systems and communication networks
Nowadays, time‐varying and high‐density data of wireless sensor systems and communication networks compel us to propose and realise low‐complexity and time‐efficient algorithms for searching, clustering, and sorting.
Shahriar Shirvani Moghaddam +1 more
doaj +1 more source
Developing a code of practice for literature searching in health sciences: a project description
Introduction: Libraries have provided mediated search services for more than forty years without a practice standard to guide the execution of searches, training of searchers, or evaluation of search performance.
Brooke Ballantyne Scott
doaj +1 more source
VSEARCH: a versatile open source tool for metagenomics [PDF]
Background VSEARCH is an open source and free of charge multithreaded 64-bit tool for processing and preparing metagenomics, genomics and population genomics nucleotide sequence data.
Torbjørn Rognes +4 more
doaj +2 more sources
Swarm-based nature-inspired optimization techniques are developing rapidly due to their universal acceptance and capability in solving various real-life challenges efficiently.
Quazi Nafees Ul Islam +2 more
doaj +1 more source

