The performance of the Multi-Level Feedback algorithm using the novel approach of smooth analysis was analyzed. As such, smooth competitive analysis provides a unifying framework for worst case and average case analysis of online algorithms. This paper considers several smoothening models, including the additive symmetric one, which adapts to the case the model introduced by Spielman and Teng.

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm / Becchetti, Luca; Leonardi, Stefano; MARCHETTI SPACCAMELA, Alberto; Guido, Schaefer; Tjark, Vredeveld. - STAMPA. - (2003), pp. 462-471. (Intervento presentato al convegno 44th Annual IEEE Symposium on Foundations of Computer Science tenutosi a Cambridge, MA; USA nel 11-14 October 2003) [10.1109/SFCS.2003.1238219].

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm

BECCHETTI, Luca;LEONARDI, Stefano;MARCHETTI SPACCAMELA, Alberto;
2003

Abstract

The performance of the Multi-Level Feedback algorithm using the novel approach of smooth analysis was analyzed. As such, smooth competitive analysis provides a unifying framework for worst case and average case analysis of online algorithms. This paper considers several smoothening models, including the additive symmetric one, which adapts to the case the model introduced by Spielman and Teng.
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/253028
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 14
social impact