Marcello Dalpasso

Prof. Marcello Dalpasso


Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1993 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
MDMarcello Dalpasso
Marcello Dalpasso
Michele of FavalliMichele of Favalli
Michele of Favalli
POP. Olivo
P. Olivo
BRB. Ricco
B. Ricco
The authors point out that the simulation of resistive bridging faults inside complex CMOS macrogates requires proper evaluation of resistances, in order to correctly determine realistic fault coverages. Here, an approach applicable to a large category of faults (bridgings, transistor stuck-ons, and node stuck-ats) that give rise to resistive paths between power supply and ground, and hence are all covered by the general term `bridging faults,' is presented. This method, which avoids the single-fault-injection procedure, fault analysis is performed inside the macrogates aimed to determine the threshold resistance, thus discriminating whether or not a given fault is detectable as a logic error. This analysis is performed inside CMOS macro-gates whose output is observable. To fully characterize the quality of a test sequence with regard to resistive bridging faults, a new definition of fault coverage is presented, because the common concept of fault detection is not applicable to parametric faults

1 January 1993
Verified
Conference Paper
Closed access
Michele of FavalliMichele of Favalli
Michele of Favalli
MDMarcello Dalpasso
Marcello Dalpasso
POP. Olivo
P. Olivo
BRB. Ricco
B. Ricco

1 January 1992
Verified
Conference Paper
Closed access
MFM. Favalli
M. Favalli
MDMarcello Dalpasso
Marcello Dalpasso
POP. Olivo
P. Olivo
BRB. Ricco
B. Ricco


23 November 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
LANCIA GIUSEPPELANCIA GIUSEPPE
LANCIA GIUSEPPE
MDMarcello Dalpasso
Marcello Dalpasso
Given a Traveling Salesman Problem solution, the best 3-OPT move requires us to remove three edges and replace them with three new ones so as to shorten the tour as much as possible. No worst-case algorithm better than the Θ(n3) enumeration of all triples is likely to exist for this problem, but algorithms with average case O(n3−ϵ) are not ruled out. In this paper we describe a strategy for 3-OPT optimization which can find the best move by looking only at a fraction of all possible moves. We extend our approach also to some other types of cubic moves, such as some special 6-OPT and 5-OPT moves. Empirical evidence shows that our algorithm runs in average subcubic time (upper bounded by O(n2.5)) on a wide class of random graphs as well as Traveling Salesman Problem Library (TSPLIB) instances.

1 January 1994
Verified
Conference Paper
Closed access
Michele of FavalliMichele of Favalli
Michele of Favalli
MDMarcello Dalpasso
Marcello Dalpasso
POP. Olivo
P. Olivo
BRB. Ricco
B. Ricco