Results 51 to 60 of about 1,094,599 (317)

Comparative Analysis of Load Balancing Algorithms for Efficient Task Scheduling in Cloud Computing [PDF]

open access: yes, 2023
: In the field of information technology cloud computing is a recently developed technology. In such a complicated system, an effective load balancing scheme is critical in order to meet peak user demands and deliver high-quality services. Load balancing
Yazeed Al Moayed, Sawsan Rabaya
core   +1 more source

A Review of Lithium-Ion Battery Fault Diagnostic Algorithms: Current Progress and Future Challenges

open access: yes, 2020
The usage of Lithium-ion (Li-ion) batteries has increased significantly in recent years due to their long lifespan, high energy density, high power density, and environmental benefits.
Michael Fowler, Manh-Kien Tran
core   +1 more source

On testing global optimization algorithms for space trajectory design [PDF]

open access: yes, 2008
In this paper we discuss the procedures to test a global search algorithm applied to a space trajectory design problem. Then, we present some performance indexes that can be used to evaluate the effectiveness of global optimization algorithms.
Marco Locatelli   +10 more
core   +1 more source

The location of the first maximum in the first sojourn of a Dyck path [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
Analysis of ...
Helmut Prodinger
doaj   +1 more source

Bayesianism: An Algorithmic Analysis

open access: yesInformation and Computation, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Heterogeneity in the Global Practice of Central Nervous System Staging in Pediatric Acute Lymphoblastic Leukemia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Central nervous system (CNS) involvement in childhood acute lymphoblastic leukemia (ALL) is assessed by cell counting and cytomorphology from cerebrospinal fluid (CSF) and is used for treatment stratification worldwide. The ratio of “CNS2” patients in clinical trials ranges from 3% to 40%, with unclear prognostic significance ...
Laura Almási   +14 more
wiley   +1 more source

Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
In a barter exchange market, agents bring items and seek to exchange their items with one another. Agents may agree to a k-way exchange involving a cycle of k agents.
Timothy Highley, Hoang Le
doaj   +1 more source

Algorithmic Randomness and Fourier Analysis [PDF]

open access: yesTheory of Computing Systems, 2018
Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-π, π]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f \in L^p[-π, π]$ given natural computability conditions on $f$ and $p$.
Johanna N. Y. Franklin   +2 more
openaire   +3 more sources

Therapeutic Apheresis for Intravenous Methylprednisolone‐Refractory Neuromyelitis Optica Spectrum Disorder: Clinical and Radiological Outcomes in a Single‐Center Case Series

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi   +5 more
wiley   +1 more source

Tight Euler tours in uniform hypergraphs - computational aspects [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices are computed ...
Zbigniew Lonc   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy