Results 51 to 60 of about 2,783,365 (285)
The location of the first maximum in the first sojourn of a Dyck path [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Helmut Prodinger
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate the diagnostic yield and utility of universal paired tumor–normal multigene panel sequencing in newly diagnosed pediatric solid and central nervous system (CNS) tumor patients and to compare the detection of germline pathogenic/likely pathogenic variants (PV/LPVs) against established clinical referral criteria for cancer ...
Natalie Waligorski +9 more
wiley +1 more source
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent [PDF]
Discrete 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
Discrete Fourier analysis of multigrid algorithms [PDF]
, 2011 The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential ...
Rhebergen, S., Vegt, J.J.W. van der
core +2 more sources
Experimental Analysis of Algorithms for Coflow Scheduling
, 2016 Modern data centers face new scheduling challenges in optimizing job-level performance objectives, where a significant challenge is the scheduling of highly parallel data flows with a common performance goal (e.g., the shuffle operations in MapReduce ...
CA Phillips +7 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Blinatumomab is a bispecific T‐cell engager approved for the treatment of pediatric B‐cell acute lymphoblastic leukemia (B‐ALL). Outpatient home infusion reduces hospitalization burden and optimizes resource utilization, but is logistically challenging.
Angela Parra del Riego +10 more
wiley +1 more source
Tight Euler tours in uniform hypergraphs - computational aspects [PDF]
Discrete 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
Analysis of concurrent algorithms
DAIMI Report Series, 1981 Analyzing the running time of a concurrent algorithm can be as important as verifying its partial correctness or termination. A simple technique for analyzing the running time of a concurrent algorithm is presented. To analyze an algorithm with concurrent processes, the interaction between the processes must be considered.
openaire +2 more sources
Analysis of Performance of Dynamic Multicast Routing Algorithms
, 1998 In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of
Ballardie +16 more
core +2 more sources
Therapeutic 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