The optimization of the output of complex computer codes has often to be achieved with a small budget of evaluations. Algorithms dedicated to such problems have been developed and compared, such as the Expected Improvement algorithm (EI) or the Informational Approach to Global Optimization (IAGO). However, the influence of noisy evaluation results on the outcome of these comparisons has often been neglected, despite its frequent appearance in industrial problems. In this paper, empirical convergence rates for EI and IAGO are compared when an additive noise corrupts the result of an evaluation. IAGO appears more efficient than EI and various modifications of EI designed to deal with noisy evaluations.