Randomized and Optimal Algorithms for
IEEE Access, 2022 In wireless sensor networks, rotating dominating set is an efficient method for balancing the energy consumption of nodes, and thereby extending the network operational time.
Weizhong Luo, Junbin Liang, Tianshu Wang
doaj +1 more source
A randomized approximate nearest neighbors algorithm [PDF]
Applied and Computational Harmonic Analysis, 2011 We present a randomized algorithm for the approximate nearest neighbor problem in d -dimensional Euclidean space. Given N points { x j } in , the ...
Peter Wilcox, Jones +2 more
openaire +2 more sources
Quantum online algorithms for a model of the request-answer game with a buffer
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 In this paper, we considered online algorithms as a request-answer game between two players: an adversary that generates input requests and an online algorithm that answers them.
K.R. Khadiev, D.I. Lin
doaj +1 more source
A Heuristic for Graph Coloring Based on the Ising Model
MathematicsWe propose a dynamic extension of the Petford–Welsh coloring algorithm that estimates the chromatic number of a graph without requiring k as an input.
Omkar Bihani, Janez Žerovnik
doaj +1 more source
Leveraging randomized compiling for the quantum imaginary-time-evolution algorithm
Physical Review Research, 2022 Recent progress in noisy intermediate-scale quantum (NISQ) hardware shows that quantum devices may be able to tackle complex problems even without error correction.
Jean-Loup Ville +15 more
doaj +1 more source
Research on Dynamic Data Stream Classification Algorithm with New Class
Jisuanji kexue yu tansuo, 2021 Aiming at the low performance in detecting new class of classification algorithm on dynamic data stream with new class, a completely randomized forest algorithm based on k-nearest neighbor (KCRForest) is proposed.
WU Weijie, ZHANG Jingxiang
doaj +1 more source
General Position Subset Selection in Line Arrangements
AlgorithmsGiven a set of n points in a plane, the General Position Subset Selection problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear.
Adrian Dumitrescu
doaj +1 more source
Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product [PDF]
QuantumTensor networks like matrix product states (MPSs) and matrix product operators (MPOs) are powerful tools for representing exponentially large states and operators, with applications in quantum many-body physics, machine learning, numerical analysis, and ...
Chris Camaño +2 more
doaj +1 more source
CluM: A Clustering–Cum–Markov model for resource prediction in a data center
International Journal of Applied Mathematics and Computer ScienceHigh-end data centers are required to process the user requests and provide them with a better quality of service. The prominent issues in building a sustainable data center are reduced carbon footprint, dynamic capacity planning to reduce resource ...
Govindarajan Madhupriya +2 more
doaj +1 more source
A Distributed Randomized Gradient-Free Algorithm for the Non-Convex Economic Dispatch Problem
Energies, 2018 In this paper, a distributed randomized gradient-free algorithm (DRGF) is employed to solve the complex non-convex economic dispatch problem whose non-convex constraints include valve-point loading effects, prohibited operating zones, and multiple fuel ...
Jun Xie, Qingyun Yu, Chi Cao
doaj +1 more source