Add to ORKGThesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1979.MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE.Vita.Bibliography: leaves 74-75.Ph.D
Althöfer I. Asymptotic properties of certain competition systems in artificial intelligence and ecol...
<p>A data set that contains the results of 1000 spatial games, for the iterated prisoner's dilemma. ...
Contains fulltext : 35102.pdf (publisher's version ) (Open Access
AbstractWe obtain the asymptotic number of labeled trounaments with a given score sequence in the ca...
International audienceWe compute the whole asymptotic expansion of the probability that a large unif...
Asymptotic expansions are widely used in studying properties of probabilities. One can mention in th...
We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is c...
AbstractAn n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs....
Althoug Chebyshev [3] and Edeworth [5] had conceived of the formal expansions for distribution of su...
We provide asymptotic and order information about the Witt vectors and integers d<sub>n</sub> appear...
<p>A data set that contains the results of 1000 spatial games, for the iterated prisoner's dilemma. ...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
[Typescript]148 leaves : ill.Thesis (Ph.D.)--University of Adelaide, Mathematical Dept. of Physics, ...
In this note, we give a combinatorial and noncomputational proof of the asymptotics of the integer m...
A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in n...
Althöfer I. Asymptotic properties of certain competition systems in artificial intelligence and ecol...
<p>A data set that contains the results of 1000 spatial games, for the iterated prisoner's dilemma. ...
Contains fulltext : 35102.pdf (publisher's version ) (Open Access
AbstractWe obtain the asymptotic number of labeled trounaments with a given score sequence in the ca...
International audienceWe compute the whole asymptotic expansion of the probability that a large unif...
Asymptotic expansions are widely used in studying properties of probabilities. One can mention in th...
We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is c...
AbstractAn n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs....
Althoug Chebyshev [3] and Edeworth [5] had conceived of the formal expansions for distribution of su...
We provide asymptotic and order information about the Witt vectors and integers d<sub>n</sub> appear...
<p>A data set that contains the results of 1000 spatial games, for the iterated prisoner's dilemma. ...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
[Typescript]148 leaves : ill.Thesis (Ph.D.)--University of Adelaide, Mathematical Dept. of Physics, ...
In this note, we give a combinatorial and noncomputational proof of the asymptotics of the integer m...
A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in n...
Althöfer I. Asymptotic properties of certain competition systems in artificial intelligence and ecol...
<p>A data set that contains the results of 1000 spatial games, for the iterated prisoner's dilemma. ...
Contains fulltext : 35102.pdf (publisher's version ) (Open Access