default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Cannings
Person information
- affiliation: School of Mathematics and Statistics, University of Sheffield, Sheffield, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j12]John Haslegrave
, Chris Cannings:
Majority dynamics with one nonconformist. Discret. Appl. Math. 219: 32-39 (2017)- 2015
- [j11]Chris Cannings:
Combinatorial Aspects of Parker's Model. Dyn. Games Appl. 5(2): 263-274 (2015) - [j10]Mark Broom, Chris Cannings:
Graphic deviation. Discret. Math. 338(5): 701-711 (2015) - 2013
- [j9]Richard Southwell, Chris Cannings:
Exploring the Space of Substitution Systems. Complex Syst. 22(1) (2013) - [j8]Richard Southwell, Jianwei Huang, Chris Cannings:
Complex Networks from Simple Rules. Complex Syst. 22(2) (2013) - [j7]Boris Mitavskiy, Elio Tuci, Chris Cannings, Jonathan E. Rowe, Jun He:
Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning. Nat. Comput. 12(4): 473-484 (2013) - [i4]Richard Southwell, Chris Cannings:
Best Response Games on Regular Graphs. CoRR abs/1301.5738 (2013) - [i3]Boris Mitavskiy, Elio Tuci, Chris Cannings, Jonathan E. Rowe, Jun He:
Geiringer Theorems: From Population Genetics to Computational Intelligence, Memory Evolutive Systems and Hebbian Learning. CoRR abs/1305.2504 (2013) - 2012
- [j6]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
A version of Geiringer-like theorem for decision making in the environments with randomness and incomplete information. Int. J. Intell. Comput. Cybern. 5(1): 36-90 (2012) - 2011
- [i2]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
A Version of Geiringer-like Theorem for Decision Making in the Environments with Randomness and Incomplete Information. CoRR abs/1110.4657 (2011)
2000 – 2009
- 2009
- [j5]Boris Mitavskiy, Chris Cannings:
Estimating the Ratios of the Stationary Distribution Values for Markov Chains Modeling Evolutionary Algorithms. Evol. Comput. 17(3): 343-377 (2009) - [j4]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. Int. J. Intell. Comput. Cybern. 2(2): 243-284 (2009) - [c6]Chris Cannings:
The majority and minority models on regular and random graphs. GAMENETS 2009 - [c5]Richard Southwell, Chris Cannings:
Games on graphs that grow deterministically. GAMENETS 2009: 347-356 - 2008
- [c4]David J. Irons, Fabrice Saffre, Chris Cannings:
Adaptive fault tolerance in wireless sensor networks. ALIFE 2008: 777 - [c3]Boris Mitavskiy, Jonathan E. Rowe, Chris Cannings:
Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links. IEEE Congress on Evolutionary Computation 2008: 1484-1491 - [i1]Boris Mitavskiy, Chris Cannings:
Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases. Theory of Evolutionary Algorithms 2008 - 2007
- [c2]Boris Mitavskiy, Chris Cannings:
An improvement of the "quotient construction" method and further asymptotic results on the stationary distributions of the Markov chains modeling evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2606-2613 - 2003
- [j3]Polixeni Dimitropoulou, Chris Cannings:
RECSIM and INDSTATS: probabilities of identity in general genealogies. Bioinform. 19(6): 790-791 (2003)
1990 – 1999
- 1999
- [j2]W. A. Khan, D. R. Hayhurst, Chris Cannings:
Determination of optimal path under approach and exit constraints. Eur. J. Oper. Res. 117(2): 310-325 (1999) - 1995
- [c1]R. P. Fletcher, Chris Cannings, P. G. Blackwell:
Modelling Foraging Behaviour of Ant Colonies. ECAL 1995: 772-783 - 1992
- [j1]Chris Cannings, J. Haigh:
Montreal Solitaire. J. Comb. Theory A 60(1): 50-66 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
