Results 61 to 70 of about 11,417,388 (340)
Fast multi-swarm optimization for dynamic optimization problems [PDF]
, 2008 This article is posted here with permission of IEEE - Copyright @ 2008 IEEEIn the real world, many applications are non-stationary optimization problems. This requires that the optimization algorithms need to not only find the global optimal solution but
Yang, S +5 more
core +1 more source
Algorithm for Solving and Updating Combinatorial Skyline [PDF]
Jisuanji gongcheng, 2017 Existing algorithms for querying combinatorial Skyline have low pruning efficiency and unsatisfactory computing speed for low-dimensional data set.Aiming at these problems,this paper proposes a fast algorithm for solving and updating combinatorial ...
DONG Leigang,LIU Guohua
doaj +1 more source
Mobility Patterns Mining Algorithms with Fast Speed
EAI Endorsed Transactions on Context-aware Systems and Applications, 2015 In recent years, mobile networks and its applications are developing rapidly. Therefore, the issue to ensure quality of service (QoS) is a key issue for the service providers.
Giang Minh Duc, Le Manh, Do Hong Tuan
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric thromboembolism is increasingly encountered in critical care. Systemic thrombolysis with tissue plasminogen activator (tPA) facilitates vessel or valve patency, yet pediatric‐specific protocols remain undefined, and safety concerns persist. Objective To evaluate the efficacy and safety of a tailored, prolonged systemic tPA
Eran Shostak +5 more
wiley +1 more source
Small-Size Algorithms for Quaternion Discrete Fourier Transform
Applied SciencesThe quaternion discrete Fourier transform (QDFT) is a powerful tool in modern digital signal processing, even though until recently this transformation seemed exotic. In recent years, quite a lot of publications have appeared devoted to effective ways to
Aleksandr Cariow +1 more
doaj +1 more source
Fast Algorithms for Computing the Statistics of Pattern Matching
IEEE Access, 2021 Pattern matching is a fundamental problem in theoretical computer science. The algorithms for pattern matching and the study on the statistics of pattern matching have found enormous applications in practical fields.
Danna Zhang, Kai Jin
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
Complexity Reduction of Polar Decoders Using Adaptive Fast-SSC and Fast-SSCL Algorithms [PDF]
EPJ Web of ConferencesIn this work, we propose a hybrid decoding approach that dynamically segments the received frame into three subframes based on the distribution of the first decoding errors.
Lamrini Mohamed +3 more
doaj +1 more source
Fast and accurate long-read alignment with Burrows–Wheeler transform
Bioinform., 2010 Motivation: Many programs for aligning short sequencing reads to a reference genome have been developed in the last 2 years. Most of them are very efficient for short reads but inefficient or not applicable for reads >200 bp because the algorithms are ...
Heng Li, R. Durbin
semanticscholar +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source