Sfoglia per Rivista NETWORKS
Mostrati risultati da 1 a 9 di 9
A Competitive Scheduling Problem and its Relevance to UMTS Channel Assignment
2004-01-01 Arbib, Claudio; Servilio, M.; Smriglio, Stefano
An implicit enumeration scheme for the batch selection problem
2004-01-01 Agnetis, A; Rossi, Fabrizio; Smriglio, Stefano
Characterization Results of All Shortest Paths Interval Routing Schemes
2001-01-01 Flammini, Michele; Gambosi, G; Nanni, U; Tan, R. B.
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.
Mostrati risultati da 1 a 9 di 9
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