We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c;x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the capacity constraints. We consider the class of canonical utility functions, consisting of functions U that are symmetric, non-decreasing, concave, and satisfy U(0) = 0. Natural primal-dual algorithms exist for maximizing suc...

This paper presents an algorithm for the discovery of building blocks in genetic programming (GP) called adaptive representation through learning (ARL). The central idea of ARL is the adaptation of the problem representation, by extending the set of terminals and functions with a set of evolvable subroutines. The set of subroutines extracts common knowledge emerging during the evolutionary proc...

Since Simon[1] and Brooks[2], robotics researchers have understood that the behaviour of a robot system is a function of the structure and dynamics of its physical construction, the environment in which it finds itself, and its internal control system. Simultaneous with the growth in popularity of this view there has been an increasing use of the word ‘behaviour’ to refer to non-phenomenologica...