Results 81 to 90 of about 4,649,254 (341)
Online algorithms for scheduling transactions on python software transactional memory [PDF]
Serbian Journal of Electrical Engineering, 2019 Designing online transaction scheduling algorithms is challenging because one needs to reconcile three opposing requirements: (i) they should be fast, (ii) they should minimize make span and maximize throughput, and (iii) they should produce ...
Popović Marko +3 more
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic kidney disease is a growing public health problem worldwide, and the number of patients requiring renal replacement therapy is steadily increasing. Türkiye has experienced a similar rise in both the incidence and prevalence of renal replacement therapy over the past decades; however, national‐level projections of future ...
Arzu Akgül +2 more
wiley +1 more source
Temporal Complexity Measure of Reaction Time Series: Operational vs. Chronological Time [PDF]
, 2022 Korosh Mahmoodi +4 more
openalex +1 more source
Average case analysis of marking algorithms [PDF]
, 1984 The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n^2) in all cases, but it has been assumed that the average case time complexity O(n lg n). It is proven that the average case time complexity is H(n^2).
Hirschberg, D. S., Larmore, L. L.
core +1 more source
Network Identification for Diffusively-Coupled Systems with Minimal Time Complexity
, 2021 The theory of network identification, namely identifying the (weighted) interaction topology among a known number of agents, has been widely developed for linear agents.
Sharf, Miel, Zelazo, Daniel
core
Revealing the structure of land plant photosystem II: the journey from negative‐stain EM to cryo‐EM
FEBS Letters, EarlyView.Advances in cryo‐EM have revealed the detailed structure of Photosystem II, a key protein complex driving photosynthesis. This review traces the journey from early low‐resolution images to high‐resolution models, highlighting how these discoveries deepen our understanding of light harvesting and energy conversion in plants.
Roman Kouřil
wiley +1 more source
Level Based Routing Using Dynamic Programming for 2D Mesh
Cybernetics and Information Technologies, 2017 The performance of the interconnection network doesn’t only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm.
Punhani Akash +2 more
doaj +1 more source
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source
Energy-Efficient Mobile Robot Control via Run-time Monitoring of Environmental Complexity and Computing Workload [PDF]
, 2021 Sherif A. S. Mohamed +4 more
openalex +1 more source
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source