Local comparison between two-step methods under the same conditions

2021 ◽  
Author(s):  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
2013 ◽  
Author(s):  
Agnes Ostertag ◽  
Francoise Peyrin ◽  
Sylvie Fernandez ◽  
Jean-Denis Laredo ◽  
Vernejoul Marie-Christine De ◽  
...  

2019 ◽  
Vol 51 ◽  
pp. 30-41 ◽  
Author(s):  
Marzieh Mokhtari ◽  
Hossein Rabbani ◽  
Alireza Mehri-Dehnavi ◽  
Raheleh Kafieh ◽  
Mohammad-Reza Akhlaghi ◽  
...  

Author(s):  
Dimitris Kalles ◽  
Alexis Kaporis ◽  
Vassiliki Mperoukli ◽  
Anthony Chatzinouskas

The authors in this chapter use simple local comparison and swap operators and demonstrate that their repeated application ends up in sorted sequences across a range of variants, most of which are also genetically evolved. They experimentally validate a square run-time behavior for emergent sorting, suggesting that not knowing in advance which direction to sort and allowing such direction to emerge imposes a n/logn penalty over conventional techniques. The authors validate the emergent sorting algorithms via genetically searching for the most favorable parameter configuration using a grid infrastructure.


Sign in / Sign up

Export Citation Format

Share Document