In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
— Robot search and rescue is a time critical task, i.e. a large terrain has to be explored by multiple robots within a short amount of time. The efficiency of exploration depend...
Alexander Kleiner, Johann Prediger, Bernhard Nebel
homologous alleles seemingly compete prior to manifestation in the observed phenotype, will be referred to as sub-phenotype interaction.A method is proposed for implementing diploi...
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...