scispace - formally typeset
J

John Mark Bishop

Researcher at Goldsmiths, University of London

Publications -  17
Citations -  385

John Mark Bishop is an academic researcher from Goldsmiths, University of London. The author has contributed to research in topics: Stochastic diffusion search & Swarm intelligence. The author has an hindex of 10, co-authored 17 publications receiving 364 citations. Previous affiliations of John Mark Bishop include University of London.

Papers
More filters
Journal ArticleDOI

Search space pruning and global optimisation of multiple gravity assist spacecraft trajectories

TL;DR: A deterministic search space pruning algorithm is developed and its polynomial time and space complexity derived and the algorithm is shown to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation.
Journal ArticleDOI

Creativity and Autonomy in Swarm Intelligence Systems

TL;DR: The paper concludes by exploring the putatve ‘creativity’ of this hybrid swarm system in the philosophical light of the ‘rhizome’ and Deleauze’s well-known ‘Orchid and Wasp’ metaphor.
Journal ArticleDOI

Stochastic Diffusion Search Review

TL;DR: Various developments of the stochastic diffusion search algorithm are reviewed, which have been shown to perform well in a variety of application domains including continuous optimisation, implementation on hardware and medical imaging.
Journal ArticleDOI

A Cognitive Computation Fallacy? Cognition, Computations and Panpsychism

TL;DR: A group of philosophical arguments that suggest either unequivocal optimism in computationalism is misplaced—computation is neither necessary nor sufficient for cognition—or panpsychism (the belief that the physical universe is fundamentally composed of elements each of which is conscious) is true are reviewed.
Journal ArticleDOI

Minimum stable convergence criteria for Stochastic Diffusion Search

TL;DR: In this article, an analysis of stochastic diffusion search (SDS) is presented, resulting in a derivation of the minimum acceptable match, and a stable convergence within a noisy search space.