Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
— Accurate generation of circuit specifications from test signatures is a difficult problem, since analytical expressions cannot precisely describe the nonlinear relationships ...
Byoungho Kim, Hongjoong Shin, Ji Hwan (Paul) Chun,...
In a recent paper, we presented proactive resilience as a new approach to proactive recovery, based on architectural hybridization. We showed that, with appropriate assumptions ab...
Paulo Sousa, Nuno Ferreira Neves, Paulo Verí...
— In this contribution, we analyze the bit error rate (BER) performance of fast frequency hopping (FFH) assisted M-ary frequency shift keying (MFSK) using product combining. Prod...
In this paper, we consider existing approaches to ontology definition and validation. Popular techniques include the use of domain experts or reliance on formal logic. We consider...