Add to ORKGI have investigated a problem which may be phrased in many ways, such as finding the probability of answering a given number of questions correctly on a randomly-completed matching test which may have a number of extra dud answers. I have determined such probabilities, the average number of correct answers, and other allied results. I have also investigated a related problem involving the number of ways of choosing a different element from each of a certain collection of sets
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
The scope of certain well-studied polynomial-time solvable classes of Satis ability is investigated ...
We show the combinatorics behind the Wilcoxon-Mann-Whitney two-sample test. This approach yields new...
I have investigated a problem which may be phrased in many ways, such as finding the probability of ...
This paper discussed how to obtain the solution to the (n,k)-matching problem, which may be started ...
The following problem was first proposed by the mathematician Pierre Rémond de Montmort [7] in Essa...
solved the following problem: Matching problem From the top of a shuffled deck of n cards having fac...
Cette thèse porte sur le développement de méthodes combinatoires pour le test et la vérification for...
In computers, pseudo-random numbers are usually generated through a linear congruential sequence. C...
Nous explorons deux familles de techniques de programmation des jeux de réflexion : des techniques d...
For a set of n discernible objects, the probability of choosing at random a permutation wi...
"September 1991.""Submitted for publication in the Journal of the American Statistical Association.
Lorsque l’on doit évaluer les résultats d’un test à l’aide de questions à choix multiples (QCM), le ...
Le texte intégral de ce document de travail n'est pas disponible en ligne. Une copie papier est disp...
This problem set includes a selection of probability problems. Probability theory started essentiall...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
The scope of certain well-studied polynomial-time solvable classes of Satis ability is investigated ...
We show the combinatorics behind the Wilcoxon-Mann-Whitney two-sample test. This approach yields new...
I have investigated a problem which may be phrased in many ways, such as finding the probability of ...
This paper discussed how to obtain the solution to the (n,k)-matching problem, which may be started ...
The following problem was first proposed by the mathematician Pierre Rémond de Montmort [7] in Essa...
solved the following problem: Matching problem From the top of a shuffled deck of n cards having fac...
Cette thèse porte sur le développement de méthodes combinatoires pour le test et la vérification for...
In computers, pseudo-random numbers are usually generated through a linear congruential sequence. C...
Nous explorons deux familles de techniques de programmation des jeux de réflexion : des techniques d...
For a set of n discernible objects, the probability of choosing at random a permutation wi...
"September 1991.""Submitted for publication in the Journal of the American Statistical Association.
Lorsque l’on doit évaluer les résultats d’un test à l’aide de questions à choix multiples (QCM), le ...
Le texte intégral de ce document de travail n'est pas disponible en ligne. Une copie papier est disp...
This problem set includes a selection of probability problems. Probability theory started essentiall...
International audienceThe seminal works of Wilf and Nijenhuis in the late 70s have led to efficient ...
The scope of certain well-studied polynomial-time solvable classes of Satis ability is investigated ...
We show the combinatorics behind the Wilcoxon-Mann-Whitney two-sample test. This approach yields new...