Sfoglia per Autore
Apprendimento delle Formule m-DNF tramite Alberi di Decisione
1991-01-01 Flammini, M
Learning DNF Formulae under Classes of Probability Distribution
1992-01-01 Flammini, M; MARCHETTI SPACCAMELA, A; Kucera, L
km-DNF Formulae are Learnable under Product Distribution
1992-01-01 Flammini, M
Boolean Routing
1993-01-01 Flammini, M; Gambosi, G; Salomone, S
km-DNF Formulae are Learnable under Product Distribution
1994-01-01 Flammini, M
Interval Routing Schemes for Chordal Rings
1994-01-01 Flammini, M; Gambosi, G; Salomone, S
The Complexity of Interval Routing on Random Graphs
1995-01-01 Flammini, M; MARCHETTI SPACCAMELA, A; VAN LEEUWEN, J
On Devising Boolean Routing Schemes
1995-01-01 Flammini, M; Gambosi, G; Salomone, S
Interval Routing Schemes
1995-01-01 Flammini, M; Gambosi, G; Salomone, S
Systolic Acyclic Orientations for Deadlock Prevention
1995-01-01 DI IANNI, M; Flammini, M; Flammini, R; Salomone, S
Un Algoritmo Dinamico Efficiente per il Mantenimento di Cammini Minimi
1995-01-01 Flammini, M; Frigioni, D; MARCHETTI SPACCAMELA, A; Nanni, U
Multi-dimensional Interval Routing Schemes
1995-01-01 Flammini, M; Gambosi, G; Nanni, U; TAN R., B
Interval Routing Schemes
1996-01-01 Flammini, M; Gambosi, G; Salomone, S
Lower Bounds on Systolic Gossiping
1997-01-01 Flammini, M; Perennes, S
Simple and Efficient Routing Schemes for All-Optical Networks
1997-01-01 Flammini, M; C., SCHEIDELER M
Graph Visitability
1997-01-01 Arbib, C; Flammini, M; Nardelli, E
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load
1997-01-01 Eilam, T; Flammini, Michele; Zaks, S.
Deadlock-Free Interval Routing Schemes
1997-01-01 Flammini, M
ATM Layouts with Bounded Hop Count and Congestion
1997-01-01 Flammini, Michele; MICHELE; NARDELLI E; PROIETTI, G.
On Devising Boolean Routing Schemes
1997-01-01 Flammini, Michele; Gambosi, G.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Apprendimento delle Formule m-DNF tramite Alberi di Decisione | 1-gen-1991 | Flammini, M | |
Learning DNF Formulae under Classes of Probability Distribution | 1-gen-1992 | Flammini, M; MARCHETTI SPACCAMELA, A; Kucera, L | |
km-DNF Formulae are Learnable under Product Distribution | 1-gen-1992 | Flammini, M | |
Boolean Routing | 1-gen-1993 | Flammini, M; Gambosi, G; Salomone, S | |
km-DNF Formulae are Learnable under Product Distribution | 1-gen-1994 | Flammini, M | |
Interval Routing Schemes for Chordal Rings | 1-gen-1994 | Flammini, M; Gambosi, G; Salomone, S | |
The Complexity of Interval Routing on Random Graphs | 1-gen-1995 | Flammini, M; MARCHETTI SPACCAMELA, A; VAN LEEUWEN, J | |
On Devising Boolean Routing Schemes | 1-gen-1995 | Flammini, M; Gambosi, G; Salomone, S | |
Interval Routing Schemes | 1-gen-1995 | Flammini, M; Gambosi, G; Salomone, S | |
Systolic Acyclic Orientations for Deadlock Prevention | 1-gen-1995 | DI IANNI, M; Flammini, M; Flammini, R; Salomone, S | |
Un Algoritmo Dinamico Efficiente per il Mantenimento di Cammini Minimi | 1-gen-1995 | Flammini, M; Frigioni, D; MARCHETTI SPACCAMELA, A; Nanni, U | |
Multi-dimensional Interval Routing Schemes | 1-gen-1995 | Flammini, M; Gambosi, G; Nanni, U; TAN R., B | |
Interval Routing Schemes | 1-gen-1996 | Flammini, M; Gambosi, G; Salomone, S | |
Lower Bounds on Systolic Gossiping | 1-gen-1997 | Flammini, M; Perennes, S | |
Simple and Efficient Routing Schemes for All-Optical Networks | 1-gen-1997 | Flammini, M; C., SCHEIDELER M | |
Graph Visitability | 1-gen-1997 | Arbib, C; Flammini, M; Nardelli, E | |
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load | 1-gen-1997 | Eilam, T; Flammini, Michele; Zaks, S. | |
Deadlock-Free Interval Routing Schemes | 1-gen-1997 | Flammini, M | |
ATM Layouts with Bounded Hop Count and Congestion | 1-gen-1997 | Flammini, Michele; MICHELE; NARDELLI E; PROIETTI, G. | |
On Devising Boolean Routing Schemes | 1-gen-1997 | Flammini, Michele; Gambosi, G. |
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