Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
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...
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
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...