Results 21 to 30 of about 4,693,176 (171)
Proceedings of the 36th ACM International Conference on Supercomputing, 2022 Data movement is becoming the dominant contributor to the time and energy costs of computation across a wide range of application domains. However, time complexity is inadequate to analyze data movement. This work expands upon Data Movement Distance, a recently proposed framework for memory-aware algorithm analysis, by 1) demonstrating that its ...
Wesley Smith, Aidan Goldfarb, Chen Ding
openaire +2 more sources
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
Verifying Time Complexity of Deterministic Turing Machines [PDF]
, 2014 We show that, for all reasonable functions $T(n)=o(n\log n)$, we can algorithmically verify whether a given one-tape Turing machine runs in time at most $T(n)$. This is a tight bound on the order of growth for the function $T$ because we prove that, for $
Gajser, David
core +1 more source
A Comprehensive Evaluation of Graph Kernels for Unattributed Graphs
Entropy, 2018 Graph kernels are of vital importance in the field of graph comparison and classification. However, how to compare and evaluate graph kernels and how to choose an optimal kernel for a practical classification problem remain open problems.
Yi Zhang, Lulu Wang, Liandong Wang
doaj +1 more source
A Complexity Measure for Continuous Time Quantum Algorithms [PDF]
, 2000 We consider unitary dynamical evolutions on n qubits caused by time dependent pair-interaction Hamiltonians and show that the running time of a parallelized two-qubit gate network simulating the evolution is given by the time integral over the chromatic ...
B. Bollobás +11 more
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
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
IEEE Access, 2022 Continuous and low-cost broadcast authentication is a fundamental security service for distributed sensor networks. This paper presents a novel development of a continuous and low-overhead broadcast authentication protocol named enhanced Infinite timed ...
Khouloud Eledlebi +5 more
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
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