The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
Agent-based simulation is increasingly used to study systems in many areas of business and science. Using agentbased simulation for prediction could be very valuable. However, the...
: For a large class of bounded-error estimation problems, the posterior feasible set 5 for the parameters can be dened by nonlinear inequalities. The set-inversion approach combine...
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...