Results 51 to 60 of about 174,873,121 (310)
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
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
Bayesianism: An Algorithmic Analysis
Information and Computation, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Identifying Patterns of Hospitalizations Among Childhood Cancer Survivors: A Population‐Based Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Childhood cancer survivors (CCSs) experience more hospitalizations than the general population. We aimed to identify distinct hospitalization patterns among Queensland CCSs and the associated characteristics. Methods Cases (aged ≤14 years) diagnosed between 1995 and 2019 while residents of Queensland were identified through the ...
Hai Pham +7 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
An analysis of a butterfly algorithm
Computers & Mathematics with Applications, 2017 Butterfly algorithms are an effective multilevel technique to compress discretizations of integral operators with highly oscillatory kernel functions. The particular version of the butterfly algorithm considered here realizes the transfer between levels by Chebyshev interpolation.
Steffen Börm +2 more
openaire +4 more sources
Performability analysis: a new algorithm [PDF]
IEEE Transactions on Computers, 1996 Summary: We propose a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
Hédi Nabli, Bruno Sericola
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose To explore caregivers' experiences and perceptions of the nutritional challenges faced by children and adolescents undergoing cancer treatment, including oral intake and the use of nutritional support. Methods This was a qualitative study based on focus groups with parents and caregivers at a Brazilian pediatric oncology hospital ...
Danyelle Apparecida Balsamão Marques +5 more
wiley +1 more source
, 2009 We reviewed all research articles in 10 recent volumes of the Journal of Applied Behavior Analysis (JABA): Vol. 28(3), 1995, through Vol. 38(2), 2005. Continuous recording was used in the majority (55%) of the 168 articles reporting data on free-operant ...
Martin, NT, Mudford, OC, Taylor, SA
core +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