On Bellman’s and Knuth’s Problems and their Generalizations
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-3928-4
Abstract: Various generalizations of the classical problem of the fastest raising to a power (or the so-called problem on addition chains) are studied in the asymptotic sense. Under weak restrictions, we demonstrate asymptotically tight solutions of… read more here.
Keywords: problems generalizations; knuth problems; bellman knuth; computational complexity ... See more keywords
Computational Complexity Analysis of FEC Decoding on SDR Platforms
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Signal Processing Systems"
DOI: 10.1007/s11265-016-1184-8
Abstract: The computational complexity evaluation is necessary for software defined Forward Error Correction (FEC) decoders. However, currently there are a limited number of literatures concerning on the FEC complexity evaluation using analytical methods. In this paper,… read more here.
Keywords: complexity analysis; fec decoding; sdr platforms; complexity ... See more keywords
Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm
Sign Up to like & getrecommendations! Published in 2020 at "TOP"
DOI: 10.1007/s11750-019-00537-x
Abstract: In this paper we analyze the computational complexity of transportation infrastructure network design problems, in the presence of a competing transportation mode. Some of these problems have previously been introduced in the literature. All problems… read more here.
Keywords: transportation; infrastructure network; network; network design ... See more keywords
On computational complexity of the constructive-optimizer neural network for the traveling salesman problem
Sign Up to like & getrecommendations! Published in 2018 at "Neurocomputing"
DOI: 10.1016/j.neucom.2018.09.039
Abstract: Abstract The authors formerly proposed the constructive-optimizer neural network (CONN) for the traveling salesman problem (TSP) to provide the best compromise between the solution quality and convergence speed. However, the computational complexity of CONN were… read more here.
Keywords: constructive optimizer; conn; optimizer neural; neural network ... See more keywords
Block coordinate descent based algorithm for computational complexity reduction in multichannel active noise control system
Sign Up to like & getrecommendations! Published in 2021 at "Mechanical Systems and Signal Processing"
DOI: 10.1016/j.ymssp.2020.107346
Abstract: Abstract Multichannel active noise control (MCANC) is widely regarded as an effective solution to achieve a significantly large noise-cancellation area in a complicated acoustic field. However, the computational complexity of MCANC algorithms, such as the… read more here.
Keywords: reduction; multichannel active; complexity; active noise ... See more keywords
Direct position determination of moving targets based on DOA
Sign Up to like & getrecommendations! Published in 2024 at "Electronics Letters"
DOI: 10.1049/ell2.13297
Abstract: Compared with the traditional two‐step localization methods, the direct position determination (DPD) method is more robust at low signal‐to‐noise ratio. However, to guarantee the optimal location result, the computational complexity of DPD with grid search… read more here.
Keywords: computational complexity; direct position; position determination; position ... See more keywords
Fundamental limitations on efficiently forecasting certain epidemic measures in network models
Sign Up to like & getrecommendations! Published in 2022 at "Proceedings of the National Academy of Sciences of the United States of America"
DOI: 10.1073/pnas.2109228119
Abstract: Significance We show that under widely believed complexity theoretic hypotheses, one cannot expect to find provably correct and efficient algorithms for predicting epidemic dynamics on general networks. These results hold even under idealized problem formulations,… read more here.
Keywords: computational complexity; network models; disease parameters; changes environment ... See more keywords
Modified Jaccard index analysis and adaptive feature selection for location fingerprinting with limited computational complexity
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Location Based Services"
DOI: 10.1080/17489725.2019.1577505
Abstract: ABSTRACT We propose an approach for fingerprinting-based positioning which reduces the data requirements and computational complexity of the online positioning stage. It is based on a segmentation of the entire region of interest into subregions,… read more here.
Keywords: modified jaccard; adaptive feature; feature selection; selection ... See more keywords
Computational complexity of exterior products and multiparticle amplitudes of noninteracting fermions in entangled states
Sign Up to like & getrecommendations! Published in 2017 at "Physical Review A"
DOI: 10.1103/physreva.96.012322
Abstract: Noninteracting bosons were proposed to be used for a demonstration of quantum-computing supremacy in a boson-sampling setup. A similar demonstration with fermions would require that the fermions are initially prepared in an entangled state. I… read more here.
Keywords: fermions entangled; multiparticle amplitudes; products multiparticle; complexity exterior ... See more keywords
Sample complexity of matrix product states at finite temperature
Sign Up to like & getrecommendations! Published in 2024 at "Physical Review B"
DOI: 10.1103/physrevb.109.224410
Abstract: For quantum many-body systems in one dimension, computational complexity theory reveals that the evaluation of ground-state energy remains elusive on quantum computers, contrasting the existence of a classical algorithm for temperatures higher than the inverse… read more here.
Keywords: temperature; computational complexity; matrix product; complexity ... See more keywords
Efficient T-EMS Based Decoding Algorithms for High-Order LDPC Codes
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2910240
Abstract: Non-binary low-density parity-check (NB-LDPC) codes show larger coding gain and lower error floor than their binary counterparts in many cases. However, the existing soft decoding algorithms of NB-LDPC codes generally suffer from high computational complexity.… read more here.
Keywords: ldpc codes; tec tems; decoding algorithms; computational complexity ... See more keywords