Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...