Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
A Quasi-Monte-Carlo method based on the computation of a surrogate model of the fitness function is proposed, and its convergence at super-linear rate 3/2 is proved under rather ...
Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines ...
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight