Results 51 to 60 of about 818,608 (269)
A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Guy Louchard, Helmut Prodinger
doaj +1 more source
An Algorithmic Analysis of the Intersection Property [PDF]
LMS Journal of Computation and Mathematics, 2004 AbstractIn this paper, efficient algorithms are given to test the intersection property and some of its variations on flag-transitive coset geometries. These algorithms are then applied to geometries of some sporadic groups, namely the Mathieu groups M11, M12, M22and M23, the Janko groups J1, J2and J3 and the Higman-Sims group HS.
Pascale Jacobs, Dimitri Leemans
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT We report a retrospective single‐center analysis of pediatric patients with relapsed or refractory B‐cell precursor acute lymphoblastic leukemia focusing on relapses outside of the typical locations, bone marrow, central nervous system, or testes.
Johanna Kunz +7 more
wiley +1 more source
Sequential selection of the k best out of nrankable objects [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The objective of this paper is to find in a setting of n sequential observations of objects a good online policy to select the k bestof these n uniquely rankable objects.
F. Thomas Bruss, Guy Louchard
doaj +1 more source
Analysis of Algorithms: An Example of a Sort Algorithm
Formalized Mathematics, 2013 Summary We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.
openaire +2 more sources
Commentary—On Algorithm Analysis [PDF]
INFORMS Journal on Computing, 1996 This is a commentary to the McGeoch's feature article. The objective is to reinforce certain issues and to suggest conceptual framework for future exploration.
openaire +1 more source
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 Background Together, leukemia and lymphoma account for 38.7% of newly diagnosed pediatric cancer cases in the United States each year. Many caregivers utilize online resources to inform medical health decisions. Understanding the readability of these materials is critical to ensuring comprehensible patient education.
Chloe Strege +6 more
wiley +1 more source
Persisting randomness in randomly growing discrete structures: graphs and search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values.
Rudolf Grübel
doaj +1 more source
ON THE EFFICIENCY OF ALGORITHMS OF ANALYSIS [PDF]
Bulletin of the American Mathematical Society, 1985 This paper is a kind of report on the author's preoccupations concerning the computational complexity. As the author declares, it is partly an exposition of recent results and new open problems, but also some new proofs are given here. There are four principal theorems, named A, B, C and D, twelve problems and many other theorems, lemmas and ...
openaire +3 more sources