Results 41 to 50 of about 1,536,819 (313)
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
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Axioms, 2022 The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and ends in the same city and visits the remaining n−1 cities exactly once.
Víctor Hugo Pacheco-Valencia +3 more
doaj +1 more source
Reduced Complexity Single-Carrier Maximum-Likelihood Detection for Decision Feedback Assisted Space-Time Equalization [PDF]
, 2006 A novel Decision-Feedback (DF) aided reduced complexity Maximum Likelihood (ML) Space-Time Equalizer (STE) designed for single-carrier multiple antenna assisted receivers is introduced. The proposed receiver structure is based on a recursive tree search,
S. Chen +7 more
core +1 more source
Computational Complexity of Modified Blowfish Cryptographic Algorithm on Video Data
Algorithms, 2022 Background: The technological revolution has allowed users to exchange data and information in various fields, and this is one of the most prevalent uses of computer technologies.
Abidemi Emmanuel Adeniyi +3 more
doaj +1 more source
Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
Mathematics, 2021 We consider the problem of scheduling n jobs with identical processing times and given release as well as delivery times on m uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job.
Nodari Vakhania, Frank Werner
doaj +1 more source
A Reduced-Complexity Detector for OFDMA/SC-FDMA-aided Space-Time Shift Keying [PDF]
, 2013 We propose a novel reduced-complexity detector for the orthogonal frequency division multiple access (OFDMA)/single-carrier frequency division multiple access (SC-FDMA)-aided space-time shift keying (STSK) architecture.
Mohammad Ismat Kadir +5 more
core +1 more source
An Efficient Algorithm for Sorting and Duplicate Elimination by Using Logarithmic Prime Numbers
Big Data and Cognitive ComputingData structures such as sets, lists, and arrays are fundamental in mathematics and computer science, playing a crucial role in numerous real-life applications.
Wei-Chang Yeh, Majid Forghani-elahabad
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Osteosarcoma (OS) and Ewing sarcoma (EWS) are the most common primary bone cancers in children, but acute thrombosis is poorly characterized in this population. Our study evaluated the rates of venous thromboembolism (VTE) and associated risk factors in pediatric patients with bone sarcomas treated over a 10‐year period encompassing
Sarah Kappa +8 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Wilms tumor (WT) treatment imposes a significant time burden on patients and their families. Time toxicity is a patient‐centered metric that quantifies the burden of healthcare interaction. We sought to define time toxicity in the first year after diagnosis of WT and hypothesized that it would increase as tumor stage and treatment ...
Caleb Q. Ashbrook +6 more
wiley +1 more source
A low-cost neural sorting network with O(1) time complexity [PDF]
, 2011 [[abstract]]In this paper, we present an O(1) time neural network with O(n1 + var epsilon) neurons and links to sort n data, var epsilon > 0. For large-size problems, it is desirable to have low-cost hardware solutions.
Lin, Shun-Shii;Hsu, Shen-Hsuan
core