Results 61 to 70 of about 22,643,313 (377)
Edge decompositions of multigraphs into multi-2-paths [PDF]
Opuscula Mathematica, 2004 We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges.
Jan Kratochvil +3 more
doaj
Dendrite Net with Acceleration Module for Faster Nonlinear Mapping and System Identification
Mathematics, 2022 Nonlinear mapping is an essential and common demand in online systems, such as sensor systems and mobile phones. Accelerating nonlinear mapping will directly speed up online systems.
Gang Liu +5 more
doaj +1 more source
On preemptive scheduling on unrelated machines using linear programming
AIMS Mathematics, 2023 We consider a basic preemptive scheduling problem where $ n $ non-simultaneously released jobs are to be processed by $ m $ unrelated parallel machines so as to minimize maximum job completion time.
Nodari Vakhania
doaj +1 more source
On Parameterized Exponential Time Complexity
Theoretical Computer Science, 2009 AbstractIn this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2o(f(k))p(n) time if and only if it is solvable in time O(2δf(k)q(n)) for any constant δ>0, where p and q are polynomials.
Ge Xia, Iyad A. Kanj, Jianer Chen
openaire +2 more sources
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]
, 2016 We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier +2 more
core +3 more sources
On Finding All Reducts of Consistent Decision Tables
Cybernetics and Information Technologies, 2015 The problem of finding reducts plays an important role in processing information on decision tables. The objective of the attribute reduction problem is to reject a redundant attribute in order to find a core attribute for data processing.
Janos Demetrovics +2 more
doaj +1 more source
Dynamical complexity of discrete time regulatory networks
, 2005 Genetic regulatory networks are usually modeled by systems of coupled differential equations and by finite state models, better known as logical networks, are also used.
Aguirre C Martin J Vilela Mendes R +5 more
core +1 more source
Linear Time Complexity Time Series Clustering with Symbolic Pattern Forest
International Joint Conference on Artificial Intelligence, 2019 With increasing powering of data storage and advances in data generation and collection technologies, large volumes of time series data become available and the content is changing rapidly.
Xiaosheng Li, Jessica Lin, Liang Zhao
semanticscholar +1 more source
Time complexity of concurrent programs [PDF]
International Workshop on Formal Aspects of Component Software, 2015 We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis cost of statements ...
Elena Giachino +3 more
semanticscholar +1 more source
Network topology drives population temporal variability in experimental habitat networks
Population Ecology, EarlyView.Habitat patches connected by dispersal pathways form habitat networks. We explored how network topology affects population outcomes in laboratory experiments using a model species (Daphnia carinata). Central habitat nodes in complex lattice networks exhibited lower temporal variability in population sizes, suggesting they support more stable ...
Yiwen Xu +3 more
wiley +1 more source