Suchergebnisse - "Complexity of algorithms"
-
1
A Practical Approach to the Time Complexity of Algorithms
ISSN: 2472-7687Veröffentlicht: IEEE 01.09.2019Veröffentlicht in Proceedings of the International Conference on European Association for Education in Electrical and Information Engineering (01.09.2019)“… attractive parts of ICT curricula and, unfortunately, theoretical subjects are very often among the candidates for possible cuts or even replacements by something more applicable …”
Volltext
Tagungsbericht -
2
Complexity of fragmentable object bin packing and an application
ISSN: 0898-1221, 1873-7668Veröffentlicht: Elsevier Ltd 01.06.1998Veröffentlicht in Computers & mathematics with applications (1987) (01.06.1998)“… We examine in this paper a variant of the bin packing problem, where it is permissible to fragment the objects while packing them into bins of fixed capacity …”
Volltext
Journal Article -
3
Depression diagnosis using machine intelligence based on spatiospectrotemporal analysis of multi-channel EEG
ISSN: 0140-0118, 1741-0444, 1741-0444Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2022Veröffentlicht in Medical & biological engineering & computing (01.11.2022)“… Depression diagnosis is a challenging clinical task currently conducted mostly using subjective criteria. It is well known that depression alters the neural …”
Volltext
Journal Article -
4
Pointcaré plot-based on-device CGM prediction model and its personalization for smart insulin pump: A step towards autonomous diabetes management
ISSN: 1746-8094Veröffentlicht: Elsevier Ltd 01.02.2026Veröffentlicht in Biomedical signal processing and control (01.02.2026)“… ) technologies, the complexity of algorithms has increased, making their direct implementation in insulin pumps more challenging owing to their extensive computational demands …”
Volltext
Journal Article -
5
Do Structured Flowcharts Outperform Pseudocode? Evidence from Eye Movements
ISSN: 2169-3536, 2169-3536Veröffentlicht: Piscataway IEEE 01.01.2022Veröffentlicht in IEEE access (01.01.2022)“… In addition, we used an eye tracking technique that allowed us to collect detailed information about the subjects' attention distribution during analysis …”
Volltext
Journal Article -
6
Метод визначення вібраційних характеристик промислового обладнання в частотній та часовій областях
ISSN: 1727-7337, 2663-2217Veröffentlicht: 20.06.2024Veröffentlicht in Avìacìjno-kosmìčna tehnìka ì tehnologìâ (20.06.2024)“… The subject of this research is the hardware and software solutions for vibration diagnostics systems and methods for processing measurement results …”
Volltext
Journal Article -
7
Method of determining the vibration characteristics of industrial equipment in the frequency and time domain
ISSN: 1727-7337, 2663-2217Veröffentlicht: National Aerospace University «Kharkiv Aviation Institute 01.06.2024Veröffentlicht in Avìacìjno-kosmìčna tehnìka ì tehnologìâ (01.06.2024)“… The subject of this research is the hardware and software solutions for vibration diagnostics systems and methods for processing measurement results …”
Volltext
Journal Article -
8
ESTIMATION OF SOFTWARE COMPLEXITY OF CALCULATION OF AUTOREGRESSION COEFFICIENTS AT DIGITAL SPECTRAL ANALYSIS
ISSN: 2522-9818, 2524-2296Veröffentlicht: Kharkiv National University of Radio Electronics 26.04.2022Veröffentlicht in Sučasnij stan naukovih doslìdženʹ ta tehnologìj v promislovostì (Online) (26.04.2022)“… The subject of research in the article are algorithms for fast calculation of autoregression coefficients in digital spectral analysis and estimation of the number of arithmetic operations required …”
Volltext
Journal Article -
9
Scheduling Theory. Single-Stage Systems
ISBN: 9401045208, 9789401045209, 9789401111911, 9780792328537, 940111191X, 0792328531Veröffentlicht: Dordrecht Springer Netherlands 1994“… Scheduling theory is an important branch of operations research. Problems studied within the framework of that theory have numerous applications in various …”
Volltext
E-Book -
10
The Concept of Sense in the Aspect of the Theory of Algorithms
Veröffentlicht: IEEE 28.09.2023Veröffentlicht in 2023 IEEE Ural-Siberian Conference on Computational Technologies in Cognitive Science, Genomics and Biomedicine (CSGB) (28.09.2023)“… The subject of the study is the concept of sense. The relevance of the study is conditioned by the development of artificial intelligence, in which the category of sense plays one of the leading roles …”
Volltext
Tagungsbericht -
11
A Low-Complexity Approach for Constructing the Optimal Binary Finite-Length Block Code
ISSN: 2474-154XVeröffentlicht: IEEE 30.11.2022Veröffentlicht in Australasian Telecommunication Networks and Applications Conference [proceedings] (30.11.2022)“… Nonetheless, the complexity of algorithms to find such a high performance block code increases dramatically as blocklength increases …”
Volltext
Tagungsbericht -
12
An Overview of the Theory of Instances Computational Complexity
ISSN: 2007-1558Veröffentlicht: Jiutepec International Journal of Combinatorial Optimization Problems & Informatics 01.05.2011Veröffentlicht in International Journal of Combinatorial Optimization Problems and Informatics (01.05.2011)“… (P, NP, NP-hard and NP-complete, and others), complexity of algorithms (it is a way to classify how efficient is an algorithm by means the execution time to solve a problem with the worst-case input …”
Volltext
Journal Article -
13
Floating point fault tolerance with backward error assertions
ISSN: 0018-9340Veröffentlicht: IEEE 01.02.1995Veröffentlicht in IEEE transactions on computers (01.02.1995)“… (n/sup 2/), compared to the O(n/sup 3/) complexity of algorithms solving Ax=b. Unlike other proposed error detection methods, this assertion model does not require any encoding of the matrix …”
Volltext
Journal Article -
14
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 03.09.2020Veröffentlicht in arXiv.org (03.09.2020)“… The problem of dispersion of mobile robots on a graph asks that \(n\) robots initially placed arbitrarily on the nodes of an \(n\)-node anonymous graph, …”
Volltext
Paper -
15
Autopoietic automata: Complexity issues in offspring-producing evolving processes
ISSN: 0304-3975, 1879-2294Veröffentlicht: Amsterdam Elsevier B.V 18.09.2007Veröffentlicht in Theoretical computer science (18.09.2007)“… ” can become a subject of their own processing. An autopoietic automaton can algorithmically generate an offspring controlled by a program which is a modification of its parent’s program …”
Volltext
Journal Article Tagungsbericht -
16
Ordered Sets for Data Analysis
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 27.08.2019Veröffentlicht in arXiv.org (27.08.2019)“… That is why we analyze the computational complexity of algorithms and problems …”
Volltext
Paper -
17
Upper Bounded Minimal Solution of the Max-Min Fuzzy Relation Inequality System
ISSN: 2169-3536, 2169-3536Veröffentlicht: Piscataway IEEE 2022Veröffentlicht in IEEE access (2022)“… Resolution of the minimal solutions plays an important role in the research on fuzzy relation equations or inequalities system. Most of the existing works …”
Volltext
Journal Article -
18
Providing theoretical learning guarantees to Deep Learning Networks
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 28.11.2017Veröffentlicht in arXiv.org (28.11.2017)“… Deep Learning (DL) is one of the most common subjects when Machine Learning and Data Science approaches are considered …”
Volltext
Paper -
19
Local and global behavior for algorithms of solving equations
ISSN: 1001-6538, 1861-9541Veröffentlicht: Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China%Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, China 01.03.2001Veröffentlicht in Chinese science bulletin (01.03.2001)“… O1; The theory of "point estimate" and the concept of "general convergence",which were put forward by Smale in order to investigate the complexity of algorithms for solving equations,have been producing …”
Volltext
Journal Article -
20
Scalability solutions for program comprehension through dynamic analysis
ISBN: 9780769525365, 0769525369ISSN: 1534-5351Veröffentlicht: IEEE 2006Veröffentlicht in Conference on Software Maintenance and Reengineering (CSMR'06) (2006)“… complexity of algorithms become too large to be handled by a computer, but also on the cognitive front …”
Volltext
Tagungsbericht

