Sfoglia per Rivista JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Mostrati risultati da 1 a 5 di 5
Approximating the Traffic Grooming Problem in Tree and Star Networks
2008-01-01 Flammini, Michele
Compact-port routing models and applications to distance-hereditary graphs
2001-01-01 Cicerone, Serafino; Flammini, Michele; DI STEFANO, Gabriele
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem
2004-01-01 Bilo', V.; Flammini, Michele; Giovannelli, R.
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing
2007-01-01 Flammini, Michele; MICHELE; SHALOM M; ZAKS, S.
Pareto Approximations for the Bicriteria Scheduling Problem
2006-01-01 Bilo', V; Flammini, Michele; Moscardelli, L.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Approximating the Traffic Grooming Problem in Tree and Star Networks | 1-gen-2008 | Flammini, Michele | |
Compact-port routing models and applications to distance-hereditary graphs | 1-gen-2001 | Cicerone, Serafino; Flammini, Michele; DI STEFANO, Gabriele | |
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem | 1-gen-2004 | Bilo', V.; Flammini, Michele; Giovannelli, R. | |
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing | 1-gen-2007 | Flammini, Michele; MICHELE; SHALOM M; ZAKS, S. | |
Pareto Approximations for the Bicriteria Scheduling Problem | 1-gen-2006 | Bilo', V; Flammini, Michele; Moscardelli, L. |
Mostrati risultati da 1 a 5 di 5
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile