Výsledky vyhledávání - "complexity of algorithms"

Low-Complexity DSP Algorithms for Mode Vector Modulation Direct-Detection Receivers

Autoři: I. Roudas A. Brisson M. Dadras

Zdroj: 2025 25th Anniversary International Conference on Transparent Optical Networks (ICTON). :1-8

Optimizing Information Freshness in Uplink Multiuser SIMO Systems: Low-Complexity Scheduling Algorithms

Autoři: Qian Wang He Chen Zheng Dong

Zdroj: IEEE Transactions on Communications. 73:4826-4840

On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms

Autoři: Walid Astaoui Youcef Magnouche Sébastien Martin

Zdroj: Annals of Operations Research. 351:849-881

Minimum-Membership Geometric Dominating Set: Complexity and Algorithms

Autoři: Bhavya Bansal Raghunath Reddy Madireddy Supantha Pandit

Zdroj: Lecture Notes in Computer Science ISBN: 9789819502141

Efficient Cyclostationary Spectrum Sensing Using Low Complexity FFT Algorithms

Autoři: May H. Abood Hikmat N. Abdullah

Zdroj: Iraqi Journal of Information & Communication Technology, Vol 7, Iss 1 (2024)

Témata: computational complexity, spectrum sensing, cognitive radio networks, cyclostationary detector, Information technology, T58.5-58.64, fast Fourier transform

Přístupová URL adresa: https://doaj.org/article/2d2b3d82843e47b7bc8ea86a45427212

Ultra-Low Complexity Communication Algorithms Based on (n, n(n-l), n-l) PGCs

Autoři: Li Peng

Zdroj: 2024 IEEE Information Theory Workshop (ITW). :418-423

Complexity Certification Algorithms for Mixed-Integer Linear and Quadratic Programming : with Applications to Hybrid MPC

Autoři: Shamisa Shoja

Zdroj: Linköping Studies in Science and Technology. Dissertations ISBN: 9789181180350

Roman {3}-domination in graphs: Complexity and algorithms

Autoři: Juhi Chaudhary Dinabandhu Pradhan

Zdroj: Discrete Applied Mathematics. 354:301-325

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

On maximal Roman domination in graphs: complexity and algorithms

Autoři: Zehui Shao Yonghao Song Qiyun Liu a další

Zdroj: RAIRO - Operations Research. 58:2709-2731

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Time complexity of algorithms

Autoři: Henry, A. A. Lopatina, A. N. Vanik, I. Y.

Přispěvatelé: Henry, A. A. Lopatina, A. N. Vanik, I. Y.

Přístupová URL adresa: https://rep.bntu.by/handle/data/155706

Bipartite Domination in Graphs: Complexity and Algorithms

Autoři: Bhawani Sankar Panda Subhasmita Joshi Dalu Jacob

Zdroj: Lecture Notes in Computer Science ISBN: 9783031834370

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms

Autoři: Chen, Jiehua Schlotter, Ildikó

Témata: FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, Computer Science and Game Theory (cs.GT)

Přístupová URL adresa: http://arxiv.org/abs/2502.01215

Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms

Autoři: Capdevielle, Tomás Cifuentes, Santiago

Témata: FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, 68T01, I.2.0

Přístupová URL adresa: http://arxiv.org/abs/2505.09640

Artificial Intelligence Aided Low Complexity RRM Algorithms for 5G-MBS

Autoři: Ernesto Fontes Pupo Claudia Carballo González Jon Montalban a další

Zdroj: Addi. Archivo Digital para la Docencia y la Investigación
Universidad del País Vasco

Témata: computational complexity, machine learning, mmWave, multicast access techniques, 5G-MBS, Computational complexity, Machine learning, Multicast access techniques, NOMA

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10810/73915
https://hdl.handle.net/11584/420264
https://doi.org/10.1109/TBC.2023.3311337

Blind Modal Parameter Identification Using Non-Negative Matrix Factorization and Generalized Complexity Pursuit Algorithms

Autoři: Subhajit Banerjee T. Jothi Saravanan

Zdroj: Lecture Notes in Civil Engineering ISBN: 9789819760664

Upward Book Embeddability of st-Graphs: Complexity and Algorithms: Complexity and Algorithms

Autoři: Binucci C. Da Lozzo G. Di Giacomo E. a další

Zdroj: Algorithmica. 85:3521-3571

Témata: SPQR-trees, st-graphs, Branchwidth, Upward book embeddings, Treewidth, Sphere-cut decomposition, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://hdl.handle.net/11391/1564740
https://doi.org/10.1007/s00453-023-01142-y

Complexity Certification Algorithms for Mixed-Integer Linear and Quadratic Programming : with Applications to Hybrid MPC

Autoři: Shoja, Shamisa

Témata: Control Engineering, Reglerteknik, Doctoral thesis, comprehensive summary, info:eu-repo/semantics/doctoralThesis, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-212610
Linköping Studies in Science and Technology. Dissertations, 0345-7524 ; 2441

Low complexity detection algorithms based on ADMIN for massive MIMO

Autoři: Shuchao Mi Jianyong Zhang Fengju Fan a další

Zdroj: China Communications. 20:67-77

Total 2-Rainbow Domination in Graphs: Complexity and Algorithms

Autoři: Manjay Kumar P. Venkata Subba Reddy

Zdroj: International Journal of Foundations of Computer Science. 35:887-906

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Diverse fair allocations: Complexity and algorithms

Autoři: Harshil Mittal Saraswati Nanoti Aditi Sethia

Zdroj: Lecture Notes in Computer Science ISBN: 9783031252105