Learn More
A number of the most powerful robust estimation algorithms, such as RANSAC, MINPRAN and LMS, have their basis in selecting random minimal sets of data to instantiate hypotheses. However, their performance degrades in higher dimensional spaces due to the exponentially decreasing probability of sampling a set that is composed entirely of inliers. In order to(More)
In this paper we present a connectionist searching technique-the Stochastic Diffusion Search (SDS), capable of rapidly locating a specified pattern in a noisy search space. In operation SDS finds the position of the prespecified pattern or if it does not exist-its best instantiation in the search space. This is achieved via parallel exploration of the whole(More)
We introduce and describe the Multiple Gravity Assist problem, a global optimisation problem that is of great interest in the design of spacecraft and their tra-jectories. We discuss its formalization and we show, in one particular problem instance, the performance of selected state of the art heuristic global optimisation algorithms. A deterministic search(More)
The Stochastic Diffusion Search algorithm-an integral part of Stochastic Search Networks is investigated. Stochastic Diffusion Search is an alternative solution for invariant pattern recognition and focus of attention. It has been shown that the algorithm can be modelled as an ergodic, finite state Markov Chain under some non-restrictive assumptions.(More)
An information-processing paradigm in the brain is proposed, instantiated in an artificial neural network using biologically motivated temporal encoding. The network will locate within the external world stimulus, the target memory, defined by a specific pattern of micro-features. The proposed network is robust and efficient. Akin in operation to the Swarm(More)
In the fourteenth chapter of The Philosophy of Information, Luciano Floridi puts forth a criticism of ‘digital ontology’ as a step toward the articulation of an ‘informational structural realism’. Based on the claims made in the chapter, the present paper seeks to evaluate the distinctly Kantian scope of the chapter from a rather unconventional viewpoint:(More)
This study reports early research aimed at applying the powerful resource allocation mechanism deployed in Stochastic Diffusion Search (SDS) [4] to the Particle Swarm Optimiser (PSO) metaheuristic [22], effectively merging the two swarm intelligence algorithms. The results reported herein suggest that the hybrid algorithm, exploiting information sharing(More)
This work details early research aimed at applying the powerful resource allocation mechanism deployed in Stochastic Diffusion Search (SDS) to the Differential Evolution (DE), effectively merging a nature inspired swarm intelligence algorithm with a biologically inspired evolutionary algorithm. The results reported herein suggest that the hybrid algorithm,(More)
This article presents the long-term behaviour analysis of Stochastic Diffusion Search (SDS), a distributed agent-based system for best-fit pattern matching. SDS operates by allocating simple agents into different regions of the search space. Agents independently pose hypotheses about the presence of the pattern in the search space and its potential(More)
of the world), or on the implicit, natural relationships that exist within the unitary system composed of both the organism and the environment. In the former case, prediction of future events occurs via the explicit manipulation of the description of the world against some metric of time. In contrast to this " weak " form of anticipation , which requires(More)