2007
DOI: 10.1016/j.jfranklin.2005.12.006
|View full text |Cite
|
Sign up to set email alerts
|

Swarm intelligence based classifiers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(17 citation statements)
references
References 17 publications
0
17
0
Order By: Relevance
“…In this work we will propose a PSO-based procedure to dynamically adjustment of RED parameters, namely, max th and min th . PSO, which is tailored for optimizing difficult numerical functions and is based on metaphor of human social interaction, is capable of mimicking the ability of human societies to process knowledge [6]. It has roots in two main component methodologies: artificial life (such as bird flocking, fish schooling and swarming); and evolutionary computation.…”
Section: Preliminaries: Red and Pso Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…In this work we will propose a PSO-based procedure to dynamically adjustment of RED parameters, namely, max th and min th . PSO, which is tailored for optimizing difficult numerical functions and is based on metaphor of human social interaction, is capable of mimicking the ability of human societies to process knowledge [6]. It has roots in two main component methodologies: artificial life (such as bird flocking, fish schooling and swarming); and evolutionary computation.…”
Section: Preliminaries: Red and Pso Algorithmsmentioning
confidence: 99%
“…Subject to : Bottleneck U tilization > T arget U tilization (6) Note that the T arget U tilization is the lowest acceptable level of utilization that is determined by the designer in range of (0, 1]. Although low values lead to smaller average queue length, its side effect is waste of the network resources.…”
Section: Minimize Avg(t)mentioning
confidence: 99%
See 1 more Smart Citation
“…The initial swarm of particles is randomly generated. Then k-means algorithm is performed and repeated at regular intervals [11]. Particles in different sub swarm (cluster) at early stage of the simulation can end up in the same local optimum, it means that those clusters are similar and merge by creating a new sub swarm.…”
Section: Fig1 Main Algorithm Pseudo Codementioning
confidence: 99%
“…This algorithm formulates the active queue management issue as an optimization problem and employs PSO technique [7]- [11] to Manuscript received November 11, 2012; revised March 5, 2013. Shahram Jamali is with the Electrical and Computer Engineering Department University of Mohaghegh Ardabili, Ardabil, Iran (e-mail: Jamali@iust.ac.ir).…”
Section: Introductionmentioning
confidence: 99%