Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
The problem of heterogeneous case representation poses a major obstacle to realising real-life multi-case-base reasoning (MCBR) systems. The knowledge overhead in developing and ma...