In this work we examined the performance of two evolutionary algorithms, a genetic algorithm (GA) and particle swarm optimization (PSO), in the estimation of the parameters of a mo...
Dulce Calcada, Agostinho Rosa, Luis C. Duarte, Vit...
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...