Results 51 to 60 of about 22,643,313 (377)
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
Theoretical analysis of garden balsam optimization algorithm
Systems Science & Control Engineering, 2022 Garden balsam optimization (GBO) is a new proposed evolutionary algorithm based on swarm intelligence. Convergence and time complexity analyses are very important in evolutionary computation, but the research on GBO is still blank.
Xiaohui Wang, Shengpu Li
doaj +1 more source
On quasilinear-time complexity theory
Theoretical Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenneth W. Regan +2 more
openaire +2 more sources
Complex Times, Complex Time: The Pandemic, Time‐Based Theorizing and Temporal Research in Management and Organization Studies [PDF]
Journal of Management Studies, 2021 The Covid-19 pandemic brings time to the foreground as a multidimensional force that pervades diverse phenomena. For example,‘flattening the curve’–the key crisis management strategy pursued by many governments–is about slowing down the spread of the virus so that hospitals gain time to ramp up capacities and to heal patients without overflowing ...
Kunisch, Sven +2 more
openaire +4 more sources
A Perceptually-Motivated Approach for Low-Complexity, Real-Time Enhancement of Fullband Speech [PDF]
Interspeech, 2020 Over the past few years, speech enhancement methods based on deep learning have greatly surpassed traditional methods based on spectral subtraction and spectral estimation.
J. Valin +5 more
semanticscholar +1 more source
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
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
Time-Optimal Gathering under Limited Visibility with One-Axis Agreement
Information, 2021 We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles following the well-celebrated classic oblivious robots model.
Pavan Poudel, Gokarna Sharma
doaj +1 more source
Technologies, 2021 Facial recognition (FR) in unconstrained weather is still challenging and surprisingly ignored by many researchers and practitioners over the past few decades.
Md Manjurul Ahsan +4 more
doaj +1 more source
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis [PDF]
, 2014 Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al.
D. Lau +14 more
core +2 more sources