We stand with Ukraine

We stand with Ukraine

Chris Cannings

Affiliations:

School of Mathematics and Statistics, University of Sheffield, Sheffield, UK

According to our database¹, Chris Cannings authored at least 20 papers between 1992 and 2017.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2017

Majority dynamics with one nonconformist.

[BibT_eX]

[DOI]

John Haslegrave

,

Discret. Appl. Math., 2017

2015

Graphic deviation.

[BibT_eX]

[DOI]

,

Discret. Math., 2015

Combinatorial Aspects of Parker's Model.

[BibT_eX]

[DOI]

Dyn. Games Appl., 2015

2013

Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning.

[BibT_eX]

[DOI]

Boris Mitavskiy

,

,

,

Jonathan E. Rowe

,

Nat. Comput., 2013

Best Response Games on Regular Graphs

[BibT_eX]

[DOI]

Richard Southwell

,

CoRR, 2013

Complex Networks from Simple Rules.

[BibT_eX]

[DOI]

Richard Southwell

,

,

Complex Syst., 2013

Exploring the Space of Substitution Systems.

[BibT_eX]

[DOI]

Richard Southwell

,

Complex Syst., 2013

2012

A version of Geiringer-like theorem for decision making in the environments with randomness and incomplete information.

[BibT_eX]

[DOI]

Boris Mitavskiy

,

Jonathan E. Rowe

,

Int. J. Intell. Comput. Cybern., 2012

2009

Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links.

[BibT_eX]

[DOI]

Boris Mitavskiy

,

Jonathan E. Rowe

,

Int. J. Intell. Comput. Cybern., 2009

Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms.

[BibT_eX]

[DOI]

Boris Mitavskiy

,

Evol. Comput., 2009

Games on graphs that grow deterministically.

[BibT_eX]

[DOI]

Richard Southwell

,

Proceedings of the 1st International Conference on Game Theory for Networks, 2009

The majority and minority models on regular and random graphs.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Game Theory for Networks, 2009

2008

Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases.

[BibT_eX]

[DOI]

Boris Mitavskiy

,

Proceedings of the Theory of Evolutionary Algorithms, 27.01. - 01.02.2008, 2008

Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links.

[BibT_eX]

[DOI]

Boris Mitavskiy

,

Jonathan E. Rowe

,

Proceedings of the IEEE Congress on Evolutionary Computation, 2008

Adaptive fault tolerance in wireless sensor networks.

[BibT_eX]

[DOI]

,

,

Proceedings of the Eleventh International Conference on the Synthesis and Simulation of Living Systems, 2008

2007

An improvement of the "quotient construction" method and further asymptotic results on the stationary distributions of the Markov chains modeling evolutionary algorithms.

[BibT_eX]

[DOI]

Boris Mitavskiy

,

Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2003

RECSIM and INDSTATS: probabilities of identity in general genealogies.

[BibT_eX]

[DOI]

Polixeni Dimitropoulou

,

Bioinform., 2003

1999

Determination of optimal path under approach and exit constraints.

[BibT_eX]

[DOI]

,

,

Eur. J. Oper. Res., 1999

1995

Modelling Foraging Behaviour of Ant Colonies.

[BibT_eX]

[DOI]

,

,

P. G. Blackwell

Proceedings of the Advances in Artificial Life, 1995

1992

Montreal Solitaire.

[BibT_eX]

,

J. Comb. Theory, Ser. A, 1992

Loading...