Results 31 to 40 of about 4,649,254 (341)

COMPLEXITY, TIME AND MUSIC [PDF]

Advances in Complex Systems, 2010
The concept of complexity as considered in terms of its algorithmic definition proposed by G. J. Chaitin and A. N. Kolmogorov is revisited for the dynamical complexity of music. When music pieces are cast in the form of time series of pitch variations, concepts of dynamical systems theory can be used to define new quantities such as the dimensionality
openaire   +3 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, Ibrahim Nabeel Joudah   +1 more
doaj   +1 more source

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

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms [PDF]

, 2019
Many graph parameters can be expressed as homomorphism counts to fixed target graphs; this includes the number of independent sets and the number of k-colorings for any fixed k.
A Göbel, A Göbel, A Schrijver, AA Bulatov, AA Bulatov, AA Bulatov, C Borgs, H Dell, J Faben, J Flum, J-Y Cai, J-Y Cai, J-Y Cai, Jacob Focke, LA Goldberg, M Freedman, ME Dyer, ME Dyer, ME Dyer, R Curticapean, R Impagliazzo, R Impagliazzo   +21 more
core   +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

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, Zbigniew Lonc, Mariusz Meszka, Zdzisław Skupień   +3 more
doaj  

Second-order DE algorithm

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, Guangzhi Xu, Dongyue Liu, Xingquan Zuo   +3 more
doaj   +1 more source

Evaluating the Performance of Eigenface, Fisherface, and Local Binary Pattern Histogram-Based Facial Recognition Methods under Various Weather Conditions

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, Yueqing Li, Jing Zhang, Md Tanvir Ahad, Kishor Datta Gupta   +4 more
doaj   +1 more source

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, Yajing Pang, Shuai Yin, Xiaoke Niu, Jing Wang, Hong Wan   +5 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, D. Lokshtanov, D.A. Cohen, E. Böhler, E. Post, G. Woeginger, J. Batson, N. Creignou, P. Jeavons, P. Jeavons, R. Impagliazzo, R. Impagliazzo, R. Santhanam, S. Khanna, V. Lagerkvist   +14 more
core   +2 more sources