A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
We address the problem of bandwidth selection in MLS surfaces. While the problem has received relatively little attention in the literature, we show that appropriate selection pla...
An important practical problem in fault diagnosis is discriminating between permanent faults and transient faults. In many computer systems, the majority of errors are due to tran...
M. Pizza, Lorenzo Strigini, Andrea Bondavalli, Fel...
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...