Local search algorithms are widely adopted in solving large-scale Distributed Constraint Optimization Problems (DCOPs). However, since each agent always makes its value decision based on the values of its neighbors in local search, those algorithms usually suffer from local premature convergence. More concretely, an agent cannot make a wise decision with poor values of its neighbors since its d...

selection of superior chance seedling genotypes is an important task in pear breeding programs. this research was carried out in order to explore and evaluate some of european pear (pyrus communis l.) chance seedling genotypes that are primarily used as rootstock for the asian pear (pyrus serotina rehd.) in tarbiat modares university (tmu) asian pear collection orchard. after four years visual ...

Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over local search alone has been already shown experimentally several times. A natural question addressed here is to understand if this superiority holds also from the worst-case point of view. Moreover, it is well known that a critic...