Our experimental results show that we can obtain optimal solutions within a reasonable amount of time for randomly generated R-MaxSAT instances with 30 variables and 150 clauses (within 40s) and R-PMaxSAT instances based on CPP benchmark problems with 60 vertices (within 500s).Sugahara, ...
Moreover, it is necessary to pay attention to the selection of the sample distribution and the adjustment of the parameters in order to improve the performance of the algorithm and increase the convergence speed. As for the shuffled frog-leaping (SFL) algorithm [32], a large amount of ...
Introduction An essential step in understanding neural coding is the characterization of the correlated structure of neural activity. Over the past two decades, much theoretical work has clarified the strong impact that correlated variability between pairs of neurons can have on the amount of ...