Results 21 to 30 of about 178,130 (288)
Production, 2021 Paper aims The objective of this article is to explore the relationship between circular economy and entrepreneurship, to propose an agenda for future research to advance in the field and generate managerial implications.
Edson Luis Kuzma +3 more
doaj +1 more source
Informatics in EducationThe design of algorithms is one of the hardest topics of high school computer science. This is mainly due to the universality of algorithms as solution methods that guarantee the calculation of a correct solution for all potentially infinitely many ...
Juraj Hromkovič, Regula Lacher
doaj +1 more source
An evaluation of Bradfordizing effects [PDF]
, 2008 The purpose of this paper is to apply and evaluate the bibliometric method Bradfordizing for information retrieval (IR) experiments. Bradfordizing is used for generating core document sets for subject-specific questions and to reorder result sets from ...
Bates Marcia J. +23 more
core +8 more sources
Quantum complexities of ordered searching, sorting, and element distinctness
, 2001 We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct.
A. Borodin +9 more
core +4 more sources
Compressed Representations of Permutations, and Applications [PDF]
, 2008 We explore various techniques to compress a permutation $\pi$ over n integers, taking advantage of ordered subsequences in $\pi$, while supporting its application $\pi$(i) and the application of its inverse $\pi^{-1}(i)$ in small time.
Barbay, Jérémy, Navarro, Gonzalo
core +7 more sources
Engineering Science and Technology, an International Journal, 2017 Controllers in some power system problems are required to satisfy different performance objectives, which could be conflicting with one another. Therefore in the process of their gain tuning, when the problem is formulated within an optimization ...
S. Chaine, M. Tripathy, Divesh Jain
doaj +1 more source
Search trees: Metric aspects and strong limit theorems
, 2014 We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces converge with ...
Grübel, Rudolf
core +1 more source
An asymmetric approach to preserve common intervals while sorting by reversals
Algorithms for Molecular Biology, 2009 Background The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios.
Gautier Christian +2 more
doaj +1 more source
An Efficient Two-Server Ranked Dynamic Searchable Encryption Scheme
IEEE Access, 2020 Searchable encryption (SE) allows users to search over encrypted data without decrypting. In most existing SE schemes, server returns all matched files without relevance ranking, and the update mechanism are suffering with high communication and ...
Yuxi Li, Fucai Zhou, Zifeng Xu, Yue Ge
doaj +1 more source
The number of bit comparisons used by Quicksort: an average-case analysis
, 2012 The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons.
Fill, James Allen, Svante Janson
core +6 more sources