Wikipedia:Articles for deletion/Simplified swarm optimization: Difference between revisions
Content deleted Content added
delete unless |
→Simplified swarm optimization: delete |
||
Line 31:
::::::* The SSO of the article is a variant of the DPSO mentioned in reference 3. Essentially, the original DPSO is simply a a modification for the PSO to work in discrete ranges. The SSO introduces a special update mechanism for the particle position that doesn't exist in the original DPSO (the original is simply the particle position + particle velocity = particle position in next time step). Other than that, the procedure for computation is the same. Basically, there are many variants based on that first DPSO paper and there is nothing that makes this particular variant notable as per [[WP:N]]. [[User:Snaphat|snaphat]] ([[User talk:Snaphat|talk]]) 05:33, 25 July 2011 (UTC)
* '''Delete''' unless someone does find an additional independent source. —''[[User:Ruud Koot|Ruud]]'' 09:59, 25 July 2011 (UTC)
* '''Delete'''. Appears to be a description of a personal variant of an algorithm. The text is enough to move me to interpretive dance: ''The best fitness function value of a specified solution with its own history is called pBest and the solution with the best fitness function value among all solutions is called gBest; both are adapted from PSO. The major difference among all soft computing methods is the UM. The fundamental concept of SSO is that each selected variable value may be generated from the current solution, pBest, gBest, or a random number according to specifics in SSO. The UM of SSO is based upon the following simple mathematically model after Cw, Cp, and Cg are defined.'' - [[User:Ihcoyc|Smerdis of Tlön]] - [[User talk:Ihcoyc|killing the human spirit since 2003!]] 16:28, 25 July 2011 (UTC)
| |||