Results 1 to 10 of about 273,415 (267)
Dynamic Parameterized Problems and Algorithms [PDF]
ACM Transactions on Algorithms, 2020 Fixed-parameter algorithms and kernelization are two powerful methods to solve NP-hard problems. Yet so far those algorithms have been largely restricted to static inputs. In this article, we provide fixed-parameter algorithms and kernelizations for fundamental NP-hard problems with dynamic ...
Matthias Mnich
exaly +7 more sources
Dynamic evidential clustering algorithm [PDF]
Knowledge-Based Systems, 2021 Abstract In this paper, a dynamic evidential clustering algorithm (DEC) is introduced to address the computational burden of existing methods. To derive such a solution, an FCM-like objective function is first employed and minimized to obtain the support levels of the real singletons (specific) clusters to which the query objects belong, and then the
Zuo-wei Zhang 0001 +4 more
openaire +2 more sources
Top-k Distance Queries on Large Time-Evolving Graphs
IEEE Access, 2023 Fast extraction of top- $k$ distances from graph data is a primitive of paramount importance in the fields of data mining, network analytics and machine learning, where ranked distances are exploited for several purposes (e.g., link prediction or ...
Andrea D'ascenzo, Mattia D'emidio
doaj +1 more source
IEEE Access, 2022 Variable bandwidth channels can be created in Flexible Grid Optical Networks using Optical Orthogonal Frequency Division Multiplexing (O-OFDM). This allows more efficient spectrum use by allocating integral multiple of basic bandwidth slots (sub-channels)
Varsha Lohani +2 more
doaj +1 more source
Discrete versus Continuous Algorithms in Dynamics of Affective Decision Making
Algorithms, 2023 The dynamics of affective decision making is considered for an intelligent network composed of agents with different types of memory: long-term and short-term memory. The consideration is based on probabilistic affective decision theory, which takes into
Vyacheslav I. Yukalov +1 more
doaj +1 more source
Structured Dynamics in the Algorithmic Agent
Entropy, 2023 In the Kolmogorov Theory of Consciousness, algorithmic agents utilize inferred compressive models to track coarse-grained data produced by simplified world models, capturing regularities that structure subjective experience and guide action planning.
Giulio Ruffini +2 more
openaire +4 more sources
Algorithmic Information Dynamics
Scholarpedia, 2020 Algorithmic Information Dynamics (AID) is an algorithmic probabilistic framework for causal discovery and causal analysis. It enables a numerical solution to inverse problems based or motivated on principles of algorithmic probability. AID studies dynamical systems in software space where all possible computable models can be found or approximated ...
Hector Zenil +3 more
openaire +2 more sources
Algorithms, 2023 Ant colony optimization (ACO) has proven its adaptation capabilities on optimization problems with dynamic environments. In this work, the dynamic traveling salesman problem (DTSP) is used as the base problem to generate dynamic test cases.
Michalis Mavrovouniotis +2 more
doaj +1 more source
Algorithms of approximate dynamic programming for hydro scheduling [PDF]
E3S Web of Conferences, 2020 In hydro scheduling, unit commitment is a complex sub-problem. This paper proposes a new approximate dynamic programming technique to solve unit commitment.
Parvez Iram, Shen Jianjian
doaj +1 more source
EEG-based real-time diagnostic system with developed dynamic 2TEMD and dynamic ApEn algorithms
Frontiers in Physiology, 2023 In real-time electroencephalography (EEG) analysis, the problem of observing dynamic changes and the problem of binary classification is a promising direction. EEG energy and complexity are important evaluation metrics in brain death determination in the
Ran Zhang +5 more
doaj +1 more source