Results 21 to 30 of about 18,929,828 (292)
The least core, kernel and bargaining sets of large games [PDF]
, 1998 We study the least core, the kernel and bargaining sets of coalitional games with a countable set of players. We show that the least core of a continuous superadditive game with a countable set of players is a non-empty (norm-compact) subset of the space
Monderer, Dov, Moreno, Diego, Einy, Ezra
core +1 more source
Generalized Additive Models with Unknown Link Function Including Variable Selection [PDF]
, 2013 The generalized additive model is a well established and strong tool that allows to model smooth effects of predictors on the response. However, if the link function, which is typically chosen as the canonical link, is misspecified, substantial bias is ...
Gerhard Tutz +3 more
core +1 more source
Deciphering the genetic basis of male fertility in Italian Brown Swiss dairy cattle
Scientific Reports, 2022 Improving reproductive performance remains a major goal in dairy cattle worldwide. Service sire has been recognized as an important factor affecting herd fertility.
Hendyel A. Pacheco +3 more
doaj +1 more source
Nonparametric estimation of an additive quantile regression model [PDF]
, 2004 This paper is concerned with estimating the additive components of a nonparametric additive quantile regression model. We develop an estimator that is asymptotically normally distributed with a rate of convergence in probability of n^{-r/(2+10)} when ...
Joel L. Horowitz +5 more
core +1 more source
MEAN VALUE OF THE ADDITIVE ANALOGUE OF SMARANDACHE FUNCTION [PDF]
, 2006 For any positive integer n, let S(n) denotes the Smarandache function, then S(n) is defined the smallest m 2 N+, where njm!. In this paper, we study the mean value properties of the additive analogue of S(n), and give an interesting mean value formula ...
Yi, Yuan and Zhang Wenpeng +1 more
core +1 more source
MEAN VALUE OF THE ADDITIVE ANALOGUE OF SMARANDACHE FUNCTION [PDF]
, 2005 For any positive integer n, let Sdf(n) denotes the Smarandance double factorial function, then Sdf(n) is defined as least positive integer m such that m!! is divisible by n.
Zhu, Minhui
core +1 more source
The Euclid Algorithm is totally gaussian [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We consider Euclid’s gcd algorithm for two integers $(p, q)$ with $1 \leq p \leq q \leq N$, with the uniform distribution on input pairs. We study the distribution of the total cost of execution of the algorithm for an additive cost function $d$ on the ...
Brigitte Vallée
doaj +1 more source
BMC Medical Informatics and Decision Making, 2021 Background Severity scores assess the acuity of critical illness by penalizing for the deviation of physiologic measurements from normal and aggregating these penalties (also called “weights” or “subscores”) into a final score (or probability) for ...
Yasser EL-Manzalawy +7 more
doaj +1 more source
Augmented Design with Additive Manufacturing Methodology: Tangible Object-Based Method to Enhance Creativity in Design for Additive Manufacturing [PDF]
, 2021 Additive manufacturing (AM) brings new design potential compared with traditional manufacturing. Nevertheless, traditional manufacturing knowledge remains embedded in the minds of designers and is a real cognitive barrier to design in AM.
BUISINE, Stéphanie +6 more
core +1 more source
Additive energies on discrete cubes
Discrete Analysis, 2023 One definition of additive combinatorics is that it is the study of subsets of (usually Abelian) groups. Two much studied parameters associated with a subset $A$ are the size of its sumset $A+A=\{a+b:a,b\in A\}$ (or the product set $A.A=\{a.b:a,b\in A\}$
Jaume de Dios Pont +3 more
doaj +1 more source