Sfoglia per Rivista NETWORKS
Deadlock-Free Interval Routing Schemes
1999-01-01 Flammini, Michele
Low Congested Interval Routing Schemes for Hypercube-Like Networks
2000-01-01 Cicerone, Serafino; DI STEFANO, Gabriele; Flammini, Michele
On LP Relaxations for the Pattern Minimization Problem
2011-01-01 A., Aloisio; Arbib, Claudio; F., Marinelli
Predicting Deadlock in Store-and-forward Networks
1990-01-01 Arbib, Claudio; Italiano, G. F.; Panconesi, A.
Scheduling Two Chains of Unit Jobs on One Machine: A Polyhedral Study
2011-01-01 Arbib, Claudio; M., Labbé; M., Servilio
Sorting Common Operations to Minimize the Number of Tardy Jobs
2014-01-01 Arbib, Claudio; Felici, G; Servilio, M.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Deadlock-Free Interval Routing Schemes | 1-gen-1999 | Flammini, Michele | |
Low Congested Interval Routing Schemes for Hypercube-Like Networks | 1-gen-2000 | Cicerone, Serafino; DI STEFANO, Gabriele; Flammini, Michele | |
On LP Relaxations for the Pattern Minimization Problem | 1-gen-2011 | A., Aloisio; Arbib, Claudio; F., Marinelli | |
Predicting Deadlock in Store-and-forward Networks | 1-gen-1990 | Arbib, Claudio; Italiano, G. F.; Panconesi, A. | |
Scheduling Two Chains of Unit Jobs on One Machine: A Polyhedral Study | 1-gen-2011 | Arbib, Claudio; M., Labbé; M., Servilio | |
Sorting Common Operations to Minimize the Number of Tardy Jobs | 1-gen-2014 | Arbib, Claudio; Felici, G; Servilio, M. |
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