Skip to search formSkip to main contentSkip to account menu

Stochastic diffusion search

Stochastic diffusion search (SDS) was first described in 1989 as a population-based, pattern-matching algorithm [Bishop, 1989]. It belongs to a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Multi Knapsack Problem (MKP) is NP-hard combinational optimization problem, also known as the multi-constraint knapsack problem… 
2014
2014
The steganalysis process comprises of two major components feature extraction and classification based on the extracted features… 
2012
2012
Have you previously submitted this study for another congress?: No Presentation Method Preference: Oral or E-Poster INTRODUCTION… 
2011
2011
To solve the quadratic knapsack problem,we propose a stochastic diffusion search algorithm which is a novel algorithm based on… 
2011
2011
Stochastic Diffusion Search (SDS) is a multi-agent, naturally inspired search and optimization algorithm that is based on direct… 
2011
2011
Analogies play an important role in many reasoning tasks. The presentation will introduce a recently proposed modeling for… 
2008
2008
This paper describes the development of an extension of a best-fit string-matching algorithm, Stochastic Diffusion Search. The… 
Review
2008
Review
2008
As one of swarm intelligence optimization algorithms,the stochastic diffusion search is characterized by partial function… 
2000
2000
The paper discusses ensemble behaviour in the Spiking Neuron Stochastic Diffusion Network, SNSDN, a novel network exploring… 
1998
1998
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .