Výsledky vyhledávání - complexity and algorithms

Algorithms and Complexity

Autoři: Marios Mavronicolas

Resource Type: eBook.

Témata: Computational complexity--Congresses, Algorithms--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Computer Architecture, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Hardware / General, MATHEMATICS / Algebra / General

Reduced-Complexity Algorithms for Tessarine Neural Networks

Autoři: Aleksandr Cariow Galina Cariowa

Zdroj: IEEE Transactions on Neural Networks and Learning Systems. 36:7751-7756

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/38619958

Low-Complexity Algorithms for Multichannel Spectral Super-Resolution

Autoři: Wu, Xunmeng Yang, Zai Xu, Zongben

Zdroj: 2025 IEEE International Conference on Acoustics, Speech, and Signal Processing Workshops (ICASSPW). :1-5

Témata: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

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

Text Complexity of Chinese Elementary School Textbooks: Analysis of Text Linguistic Features Using Machine Learning Algorithms

Autoři: Miaomiao Liu Yixun Li Yongqiang Su a další

Zdroj: Scientific Studies of Reading. 2024 28(3):235-255.

Peer Reviewed: Y

Page Count: 21

Descriptors: Difficulty Level, Textbooks, Algorithms, Artificial Intelligence, Foreign Countries, Predictor Variables, Word Frequency, Semantics, Syntax, Speech Communication, Elementary School Students, Language Variation, Chinese, Language Arts, Textbook Evaluation, Orthographic Symbols, Computational Linguistics, Discourse Analysis

Geografický termín: China

Fractional Discrete Computer Virus System: Chaos and Complexity Algorithms

Autoři: Ma’mon Abu Hammad Imane Zouak Adel Ouannas a další

Zdroj: Algorithms, Vol 18, Iss 7, p 444 (2025)

Témata: Industrial engineering. Management engineering, chaos, Electronic computers. Computer science, computer virus model, incommensurate order, QA75.5-76.95, stability, T55.4-60.8, complexity algorithms, commensurate order

Přístupová URL adresa: https://doaj.org/article/88e112cf32ba4e34b440e03851073d63

Digital Signal Processing (DSP)-Oriented Reduced-Complexity Algorithms for Calculating Matrix–Vector Products with Small-Order Toeplitz Matrices

Autoři: Janusz P. Papliński Aleksandr Cariow Paweł Strzelec a další

Zdroj: Signals, Vol 5, Iss 3, Pp 417-437 (2024)

Témata: T57-57.97, Applied mathematics. Quantitative methods, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Toeplitz matrix, multiplication complexity, matrix–vector product

Přístupová URL adresa: https://doaj.org/article/29f6a1612bf74fae9d3794a76f0dc947

Low Complexity Algorithms for Mission Completion Time Minimization in UAV-Based Emergency Response

Autoři: Mateen Ashraf Anna Gaydamaka Bo Tan a další

Přispěvatelé: Mateen Ashraf Anna Gaydamaka Bo Tan a další

Zdroj: IEEE Transactions on Intelligent Vehicles. 9:7945-7960

Popis souboru: fulltext

Decision Support System Driven by Thermo-Complexity: Algorithms and Data Manipulation

Autoři: GERARDO IOVANE

Zdroj: IEEE Access, Vol 12, Pp 157359-157382 (2024)

Témata: data visualization, data management, Electrical engineering. Electronics. Nuclear engineering, algorithms, data analytics, Decision support system, TK1-9971

Přístupová URL adresa: https://doaj.org/article/d29ad63aac4c42e8a36a009367626606
https://hdl.handle.net/11386/4888115
https://doi.org/10.1109/ACCESS.2024.3482711
https://ieeexplore.ieee.org/document/10720767

Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning

Autoři: Steinmetz, Marcel Thiébaux, Sylvie Höller, Daniel a další

Přispěvatelé: Steinmetz, Marcel Thiébaux, Sylvie Höller, Daniel a další

Zdroj: Proceedings of the International Conference on Automated Planning and Scheduling. 34:555-564

Témata: Explanations of solutions, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Automated Planning, Constrained Stochastic Shortest Path Problems, Stochastic Shortest Path Problems, Multi-Objective Optimisation

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-04561864v1

GEOMETRIC COMPLEXITY THEORY V : EFFICIENT ALGORITHMS FOR NOETHER NORMALIZATION

Autoři: MULMULEY, KETAN D.

Zdroj: Journal of the American Mathematical Society, 2017 Jan 01. 30(1), 225-309.

Přístupová URL adresa: https://www.jstor.org/stable/jamermathsoci.30.1.225

CONVERGENCE COMPLEXITY ANALYSIS OF ALBERT AND CHIB’S ALGORITHM FOR BAYESIAN PROBIT REGRESSION

Autoři: Qin, Qian Hobert, James P.

Zdroj: The Annals of Statistics, 2019 Aug 01. 47(4), 2320-2347.

Přístupová URL adresa: https://www.jstor.org/stable/26754232

COMPLEXITY BOUNDS FOR MARKOV CHAIN MONTE CARLO ALGORITHMS VIA DIFFUSION LIMITS

Autoři: ROBERTS, GARETH O. ROSENTHAL, JEFFREY S.

Zdroj: Journal of Applied Probability, 2016 Jun 01. 53(2), 410-420.

Přístupová URL adresa: http://www.jstor.org/stable/43860930

Linear Time Complexity Algorithms for Time Domain Simulations of the Structural Mechanical Behaviour of Submarine Power Cables in Offshore Wind Power Applications

Autoři: Clemens Schütt Christoph Otto Sascha Kosleck a další

Zdroj: OCEANS 2024 - Singapore. :1-10

The Complexity of Generic Primal Algorithms for Solving General Integer Programs

Autoři: Schulz, Andreas S. Weismantel, Robert

Zdroj: Mathematics of Operations Research, 2002 Nov 01. 27(4), 681-692.

Přístupová URL adresa: https://www.jstor.org/stable/3690461

Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms

Autoři: Balev, Stefan Pigné, Yoann Sanlaville, Éric a další

Přispěvatelé: Balev, Stefan Pigné, Yoann Sanlaville, Éric a další

Témata: Steiner Tree, Dynamic Graph, Complexity, ddc:004, experimental study

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.24

Complexity Results and Approximation Algorithms for the Two Machine No-Wait Flow-Shop with Limited Machine Availability

Autoři: Formanowicz, P. Penz, B.

Zdroj: The Journal of the Operational Research Society, 2001 Jan 01. 52(1), 116-121.

Přístupová URL adresa: https://www.jstor.org/stable/254115

Algorithms, complexity, and the sciences

Autoři: Papadimitriou, Christos

Zdroj: Proceedings of the National Academy of Sciences of the United States of America, 2014 Nov 01. 111(45), 15881-15887.

Přístupová URL adresa: https://www.jstor.org/stable/43279180

Low-Complexity Algorithms for Trinion-Based Digital Signal Processing

Autoři: Aleksandr Cariow

Zdroj: 2023 Signal Processing Symposium (SPSympo). :23-27

NEW QUASI-OPTIMAL ALGORITHMS OF ANTENNA SELECTION WITH LOW COMPLEXITY

Autoři: M.G. BAKULIN V.B. KREYNDELIN M.L. KHAZOV

Zdroj: T-Comm. 17:47-56

The loader problem: formulation, complexity and algorithms

Autoři: Tang, G Chen, F Cheng, TCE a další

Zdroj: The Journal of the Operational Research Society, 2010 May 01. 61(5), 840-848.

Přístupová URL adresa: https://www.jstor.org/stable/40608245