Results 11 to 20 of about 294,257 (261)
Adjacency Maps and Efficient Graph Algorithms
Algorithms, 2022 Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In
Gabriel Valiente
doaj +1 more source
Efficient primer design algorithms [PDF]
Bioinformatics, 2001 Abstract Motivation: Primer design involves various parameters such as string-based alignment scores, melting temperature, primer length and GC content. This entails a design approach from multicriteria decision making. Values of some of the criteria are easy to compute while others require intense calculations.
T, Kämpke, M, Kieninger, M, Mecklenburg
openaire +2 more sources
Novel and Efficient Randomized Algorithms for Feature Selection
Big Data Mining and Analytics, 2020 Feature selection is a crucial problem in efficient machine learning, and it also greatly contributes to the explainability of machine-driven decisions. Methods, like decision trees and Least Absolute Shrinkage and Selection Operator (LASSO), can select ...
Zigeng Wang +2 more
doaj +1 more source
Efficient Subspace Approximation Algorithms [PDF]
Discrete & Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shyamalkumar, Nariankadu D. +1 more
openaire +1 more source
Deriving Efficient Graph Algorithms [PDF]
, 2003 Computer Science ...
Reif, John H., Scherlis, William Louis.
openaire +1 more source
Energy-Efficient Algorithms [PDF]
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016 40 pages, 8 pdf figures, full version of work published in ITCS ...
Demaine, Erik D +3 more
openaire +4 more sources
Two Efficient Algorithms for Weighted P-Median Problem
Communications, 2015 We propose a genetic algorithm for a weighted p-median problem. It is a facility location problem. The algorithm generates a good solution quickly. Computational tests were realized on five different tasks from 21 vertices to 100 vertices and from p ...
Vladimir Medvid
doaj +1 more source
Efficient maxima-finding algorithms for random planar samples [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We collect major known algorithms in the literature for finding the maxima of multi-dimensional points and provide a simple classification. Several new algorithms are proposed.
Wei-Mei Chen +2 more
doaj +2 more sources
Efficient classical algorithms for simulating symmetric quantum systems [PDF]
Quantum, 2023 In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts given certain
Eric R. Anschuetz +3 more
doaj +1 more source
Correct and Efficient Antichain Algorithms for Refinement Checking [PDF]
Logical Methods in Computer Science, 2021 The notion of refinement plays an important role in software engineering. It is the basis of a stepwise development methodology in which the correctness of a system can be established by proving, or computing, that a system refines its specification ...
Maurice Laveaux +2 more
doaj +1 more source