Results 21 to 30 of about 459,449 (308)
Power efficient dynamic resource scheduling algorithms for LTE [PDF]
, 2010 This paper presents a link level analysis of the rate and energy efficiency performance of the LTE downlink considering the unitary codebook based precoding scheme.
Beh, KC +9 more
core +1 more source
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
Efficient Subspace Approximation Algorithms [PDF]
Discrete & Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nariankadu D. Shyamalkumar +1 more
openaire +2 more sources
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
An efficient parallel algorithm for planarity [PDF]
Journal of Computer and System Sciences, 1986 The authors give a parallel algorithm for testing graph planarity, and for finding an embedding of a planar graph. Their algorithm runs in \(O(\log^ 2 n)\) steps on n processors of a CREW PRAM. This is an improvement to a previous best parallel algorithm due to Ja'Ja' and Simon.
Philip N. Klein, John H. Reif
openaire +2 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
An Efficient Parallel Biconnectivity Algorithm [PDF]
SIAM Journal on Computing, 1985 In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in \(O(n+m)\) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and \(O(n+m)\) space using \(O(n+m)\) processors on a concurrent-read, concurrent-write parallel ...
Robert Endre Tarjan, Uzi Vishkin
openaire +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
On the efficiency of subsumption algorithms
Journal of the ACM, 1985 The costs of subsumption algorithms are analyzed by an estimation of the maximal number of unification attempts (worst-case unification complexity) made for deciding whether a clause C subsumes a clause D .
Georg Gottlob, Alexander Leitsch
openaire +2 more sources
An Efficient Algorithm for Graph Isomorphism [PDF]
Journal of the ACM, 1970 A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representative graph and the reordered graph, are derived. The representative graph is a homomorphic image of the original graph; the reordered graph is constructed from the representative graph to be isomorphic to the ...
Derek G. Corneil, C. C. Gotlieb
openaire +1 more source