In most real-world problems, we either know little about the problems or the problems are too complex to have a clear vision on how to decompose them by hand. Thus, it is usually d...
Minh Ha Nguyen, Hussein A. Abbass, Robert I. McKay
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Non-random mating seems to be the norm in nature among sexual organisms. A common mating criteria among animals is assortative mating, where individuals mate according to their phe...