Opposition versus randomness in soft computing techniques

By Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A. Salama. Applied Soft Computing, 2008

340 citations recorded by the source corpus.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/112952ee05e0a7d8dd78f0eb46ec567dcb89ebd4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Shahryar Rahnamayan
2. Magdy M. A. Salama
3. Hamid R. Tizhoosh
4. Sedigheh Mahdavi
5. Konstantinos E. Parsopoulos
6. Mohammad Ebrahim Shiri
7. Ferrante Neri
8. Ville Tirronen

Citations in the corpus

• Quasi-oppositional Differential Evolution (2007, background): “A mathematical proof has been provided to show that, in general, opposite numbers are more likely to be closer to the optimal solution than purely random ones [13].”
• Opposition-Based Differential Evolution (2008, background): “In fact, a mathematical proof has been proposed to show that, in general, opposite numbers are more likely to be closer to the optimal solution than purely random ones [12].”