We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated ...
Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
— In this paper, several portfolio selection problems with normal mixture distributions including fuzziness are proposed. Until now, many researchers have proposed portfolio mode...
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...