Results 31 to 40 of about 22,781,989 (354)
Fast Algorithms for Basic Supply Chain Scheduling Problems
Mathematics, 2020 A basic supply chain scheduling problem in which the orders released over time are to be delivered into the batches with unlimited capacity is considered.
Nodari Vakhania, Badri Mamporia
doaj +1 more source
Theory and Applications of Probabilistic Kolmogorov Complexity [PDF]
arXiv, 2022 Diverse applications of Kolmogorov complexity to learning [CIKK16], circuit complexity [OPS19], cryptography [LP20], average-case complexity [Hir21], and proof search [Kra22] have been discovered in recent years. Since the running time of algorithms is a key resource in these fields, it is crucial in the corresponding arguments to consider time-bounded
arxiv
Time Complexity of Decentralized Fixed-Mode Verification [PDF]
, 2010 Given an interconnected system, this note is concerned with the time complexity of verifying whether an unrepeated mode of the system is a decentralized fixed mode (DFM).
Lavaei, Javad, Sojoudi, Somayeh
core +1 more source
Shape matching and object recognition using common base triangle area
IET Computer Vision, 2015 Shape matching has always been a key issue in the field of computer vision. To obtain high recognition accuracy with low time complexity and to reduce the influence of contour deformation due to noise in shape matching, a novel shape matching method ...
Dameng Hu +4 more
doaj +1 more source
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
CAAI Transactions on Intelligence Technology, 2019 Differential evolution (DE) is a robust, efficient and simple evolutionary algorithm for various optimisation and engineering problems. It has several outstanding features such as low time complexity, ease to use and robust steadiness.
Xinchao Zhao +3 more
doaj +1 more source
Quantifying the Dynamical Complexity of Chaotic Time Series [PDF]
, 2016 Acknowledgements The author wishes to acknowledge G. Giacomelli, M. Mulansky, and L.
Politi, Antonio
core +2 more sources
On a New Formula for Fibonacci’s Family m-step Numbers and Some Applications
Mathematics, 2019 In this work, we obtain a new formula for Fibonacci’s family m-step sequences. We use our formula to find the nth term with less time complexity than the matrix multiplication method.
Monther Rashed Alfuraidan +1 more
doaj +1 more source
Distributed MIS with Low Energy and Time Complexities [PDF]
arXiv, 2023 We present randomized distributed algorithms for the maximal independent set problem (MIS) that, while keeping the time complexity nearly matching the best known, reduce the energy complexity substantially. These algorithms work in the standard CONGEST model of distributed message passing with $O(\log n)$ bit messages.
arxiv
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