Results 281 to 290 of about 11,417,388 (340)
Resource-Efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization. [PDF]
J Chem Theory ComputGraves V +3 more
europepmc +1 more source
Modified Dhole-inspired optimization for maximum power extraction in photovoltaic systems under partial shading. [PDF]
Sci RepCelikel R, Aydogmus O, Yilmaz M.
europepmc +1 more source
Fast algorithms for the quantile regression process [PDF]
Empirical Economics, 2019 The widespread use of quantile regression methods depends crucially on the existence of fast algorithms. Despite numerous algorithmic improvements, the computation time is still non-negligible because researchers often estimate many quantile regressions ...
V. Chernozhukov +2 more
semanticscholar +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Foundations of Discrete Harmonic Analysis, 2020
V. N. Malozemov, S. M. Masharsky
semanticscholar +2 more sources
V. N. Malozemov, S. M. Masharsky
semanticscholar +2 more sources
FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness
Neural Information Processing Systems, 2022Transformers are slow and memory-hungry on long sequences, since the time and memory complexity of self-attention are quadratic in sequence length. Approximate attention methods have attempted to address this problem by trading off model quality to ...
Tri Dao +4 more
semanticscholar +1 more source
Evaluating Fast Algorithms for Convolutional Neural Networks on FPGAs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2020In recent years, convolutional neural networks (CNNs) have become widely adopted for computer vision tasks. Field-programmable gate arrays (FPGAs) have been adequately explored as a promising hardware accelerator for CNNs due to its high performance ...
Yun Liang +3 more
semanticscholar +1 more source
Journal of the ACM, 1979
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.
Mark R. Brown, Robert Endre Tarjan
openaire +1 more source
We give an algorithm which merges sorted lists represented as balanced binary trees. If the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order as the lower bound on all comparison-based algorithms for this problem.
Mark R. Brown, Robert Endre Tarjan
openaire +1 more source
ORSA Journal on Computing, 1994
This paper considers the problem of partitioning the vertices of a weighted complete graph into cliques of unbounded size and number, such that the sum of the edge weights of all cliques is maximized. The problem is known as the clique-partitioning problem and arises as a clustering problem in qualitative data analysis.
Ulrich Dorndorf, Erwin Pesch
openaire +1 more source
This paper considers the problem of partitioning the vertices of a weighted complete graph into cliques of unbounded size and number, such that the sum of the edge weights of all cliques is maximized. The problem is known as the clique-partitioning problem and arises as a clustering problem in qualitative data analysis.
Ulrich Dorndorf, Erwin Pesch
openaire +1 more source
Applied Mathematics and Computation, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dmitry K. Firsov, Shiu Hong Lui
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dmitry K. Firsov, Shiu Hong Lui
openaire +2 more sources
Engineering Applications of Artificial Intelligence, 2008
The aim of this paper is to design an efficient and fast clonal algorithm for solving various numerical and combinatorial real-world optimization problems effectively and speedily, irrespective of its complexity. The idea is to accurately read the inherent drawbacks of existing immune algorithms (IAs) and propose new techniques to resolve them.
Nitesh Khilwani +3 more
openaire +2 more sources
The aim of this paper is to design an efficient and fast clonal algorithm for solving various numerical and combinatorial real-world optimization problems effectively and speedily, irrespective of its complexity. The idea is to accurately read the inherent drawbacks of existing immune algorithms (IAs) and propose new techniques to resolve them.
Nitesh Khilwani +3 more
openaire +2 more sources