Results 1 to 10 of about 23,812 (301)
No sorting? better searching! [PDF]
ACM Transactions on Algorithms, 2004 Questions about order versus disorder in systems and models have been fascinating scientists over the years. In computer science, order is intimately related to sorting, commonly meant as the task of arranging keys in increasing or decreasing order with respect to an underlying total order relation.
FRANCESCHINI G, GROSSI, ROBERTO
core +7 more sources
Research Progress and Challenge of Programming by Examples [PDF]
Jisuanji kexue, 2022 Program synthesis means that the computer automatically constructs code that conforms to the specified grammar and user’s given specifications.Programming by examples is a kind of paradigm in program synthesis that takes input and output examples as the ...
YAN Qian-yu, LI Yi, PENG Xin
doaj +1 more source
Search, Screening and Sorting [PDF]
SSRN Electronic Journal, 2021 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]
SSRN Electronic Journal, 2005 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
A note on limits of sequences of binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 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]
Jisuanji gongcheng, 2017 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]
Vietnam Journal of Computer Science, 2019 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
IET Wireless Sensor Systems, 2023 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
Journal of the Canadian Health Libraries Association, 2022 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]
PeerJ, 2016 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