| 2009 |
|---|
| 30 | EE | Alexander A. Davydov,
Stefano Marcugini,
Fernanda Pambianco:
Complete ( q 2 + q + 8)/2-caps in the spaces PG (3, q ), q = 2 (mod 3) an odd prime, and a complete 20-cap in PG (3, 5).
Des. Codes Cryptography 50(3): 359-372 (2009) |
| 29 | EE | Jürgen Bierbrauer,
Yves Edel,
Giorgio Faina,
Stefano Marcugini,
Fernanda Pambianco:
Short Additive Quaternary Codes.
IEEE Transactions on Information Theory 55(3): 952-954 (2009) |
| 2008 |
|---|
| 28 | | Olof Heden,
Stefano Marcugini,
Fernanda Pambianco,
Leo Storme:
On the non-existence of a maximal partial spread of size 76 in PG(3, 9).
Ars Comb. 89: (2008) |
| 2007 |
|---|
| 27 | EE | Stefano Marcugini,
Alfredo Milani,
Fernanda Pambianco:
Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs.
Discrete Mathematics 307(6): 739-747 (2007) |
| 2006 |
|---|
| 26 | EE | Emanuela Falcinelli,
Stefano Marcugini,
Alfredo Milani:
An Architecture for Dynamical News Providers.
IAT Workshops 2006: 200-203 |
| 25 | EE | Jürgen Bierbrauer,
Stefano Marcugini,
Fernanda Pambianco:
The smallest size of a complete cap in PG(3, 7).
Discrete Mathematics 306(13): 1257-1263 (2006) |
| 24 | EE | Alexander A. Davydov,
Stefano Marcugini,
Fernanda Pambianco:
Minimal 1-saturating sets and complete caps in binary projective spaces.
J. Comb. Theory, Ser. A 113(4): 647-663 (2006) |
| 2005 |
|---|
| 23 | EE | Alfredo Milani,
Silvia Suriani,
Stefano Marcugini:
Evolutionary online services.
ICEC 2005: 343-349 |
| 22 | EE | Alfredo Milani,
Stefano Marcugini:
An Architecture for Evolutionary Adaptive Web Systems.
WINE 2005: 444-454 |
| 21 | EE | Stefano Marcugini,
Alfredo Milani,
Fernanda Pambianco:
Maximal (n, 3)-arcs in PG(2, 13).
Discrete Mathematics 294(1-2): 139-145 (2005) |
| 20 | EE | Jürgen Bierbrauer,
Stefano Marcugini,
Fernanda Pambianco:
A family of highly symmetric codes.
IEEE Transactions on Information Theory 51(10): 3665-3668 (2005) |
| 19 | EE | Alexander A. Davydov,
Giorgio Faina,
Stefano Marcugini,
Fernanda Pambianco:
Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces.
IEEE Transactions on Information Theory 51(12): 4378-4387 (2005) |
| 2004 |
|---|
| 18 | | Alexander A. Davydov,
Stefano Marcugini,
Fernanda Pambianco:
Linear codes with covering radius 2, 3 and saturating sets in projective geometry.
IEEE Transactions on Information Theory 20(3): 537-541 (2004) |
| 2003 |
|---|
| 17 | EE | Jürgen Bierbrauer,
Stefano Marcugini,
Fernanda Pambianco:
Projective Planes, Coverings and a Network Problem.
Des. Codes Cryptography 29(1-3): 71-89 (2003) |
| 16 | EE | Alexander A. Davydov,
Stefano Marcugini,
Fernanda Pambianco:
On saturating sets in projective spaces.
J. Comb. Theory, Ser. A 103(1): 1-15 (2003) |
| 2002 |
|---|
| 15 | EE | Giorgio Faina,
György Kiss,
Stefano Marcugini,
Fernanda Pambianco:
The Cyclic Model for PG(n,q) and a Construction of Arcs.
Eur. J. Comb. 23(1): 31-35 (2002) |
| 14 | | Stefano Marcugini,
Alfredo Milani,
Fernanda Pambianco:
NMDS Codes of maximal length over Fq, 8 <= q <= 11.
IEEE Transactions on Information Theory 48(4): 963-966 (2002) |
| 2001 |
|---|
| 13 | | Stefano Marcugini,
Alfredo Milani,
Fernanda Pambianco:
Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9).
Ars Comb. 61: (2001) |
| 2000 |
|---|
| 12 | | Marco Baioletti,
Stefano Marcugini,
Alfredo Milani:
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph.
AIPS 2000: 13-21 |
| 1999 |
|---|
| 11 | EE | Stefano Marcugini,
Alfredo Milani,
Fernanda Pambianco:
Maximal (n, 3)-arcs in PG(2, 11).
Discrete Mathematics 208-209: 421-426 (1999) |
| 1998 |
|---|
| 10 | EE | Marco Baioletti,
Stefano Marcugini,
Alfredo Milani:
An Extension of SATPLAN for Planning with Constraints.
AIMSA 1998: 39-49 |
| 9 | | Marco Baioletti,
Stefano Marcugini,
Alfredo Milani:
Encoding Planning Constraints into Partial Order Planners.
KR 1998: 608-616 |
| 8 | | Giorgio Faina,
Stefano Marcugini,
Alfredo Milani,
Fernanda Pambianco:
The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5.
Ars Comb. 50: (1998) |
| 1997 |
|---|
| 7 | | Marco Baioletti,
Stefano Marcugini,
Alfredo Milani:
Compiling Task Networks into Partial Order Planning Domains.
AI*IA 1997: 311-321 |
| 6 | | Marco Baioletti,
Stefano Marcugini,
Alfredo Milani:
Task Planning and Partial Order Planning: A Domain Transformation Approach.
ECP 1997: 52-63 |
| 5 | | Giorgio Faina,
Stefano Marcugini,
Alfredo Milani,
Fernanda Pambianco:
The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23.
Ars Comb. 47: (1997) |
| 1995 |
|---|
| 4 | | Marco Baioletti,
Stefano Marcugini,
Alfredo Milani:
A Weakest Precondition Semantics for Conditional Planning.
AI*IA 1995: 291-302 |
| 1992 |
|---|
| 3 | | Stefano Marcugini,
Alfredo Milani,
Maurizio Terragnolo:
Plans as Planning Objects.
AIMSA 1992: 35-44 |
| 1991 |
|---|
| 2 | | Bruno Fringuelli,
Stefano Marcugini,
Alfredo Milani,
Silvano Rivoira:
Truth Maintenance in Approximate Reasoning.
AI*IA 1991: 430-434 |
| 1 | EE | Bruno Fringuelli,
Stefano Marcugini,
Alfredo Milani,
Silvano Rivoira:
A Reason Maintenance System Dealing with Vague Data.
UAI 1991: 111-117 |
