Results 231 to 240 of about 137,934 (261)
Some of the next articles are maybe not open access.
Proceedings of the 2018 Great Lakes Symposium on VLSI, 2018
To close the ever widening verification gap, new powerful solutions are strictly required. One such promising approach aims in continuing verification tasks after production of a chip during its lifetime. This approach is called self-verification. However, for realizing self-verification tasks on-chip, verification packages have to be developed.
Buse Ustaoglu +3 more
openaire +1 more source
To close the ever widening verification gap, new powerful solutions are strictly required. One such promising approach aims in continuing verification tasks after production of a chip during its lifetime. This approach is called self-verification. However, for realizing self-verification tasks on-chip, verification packages have to be developed.
Buse Ustaoglu +3 more
openaire +1 more source
Combinatorics, Probability and Computing, 1995
LetSbe a set ofmclauses each containing three literals chosen at random in a set {p1, ¬p1,…,pn, ¬pn} ofnpropositional variables and their negations. Letbe the set of all suchSwithm = cnfor a fixedc> 0. We show, improving significantly over the first moment upper bound, that ifmandntend to infinity with, then almost allare unsatisfiable.
A. El Maftouhi +1 more
openaire +1 more source
LetSbe a set ofmclauses each containing three literals chosen at random in a set {p1, ¬p1,…,pn, ¬pn} ofnpropositional variables and their negations. Letbe the set of all suchSwithm = cnfor a fixedc> 0. We show, improving significantly over the first moment upper bound, that ifmandntend to infinity with, then almost allare unsatisfiable.
A. El Maftouhi +1 more
openaire +1 more source
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture, 2008
Establishing trust in vehicular networks is a critical but also difficult task. In this position paper, we present a new trust architecture and model - Situation-Aware Trust (SAT) - to address several important trust issues in vehicular networks that we believe are essential to overcome the weaknesses of the current vehicular network security and trust
Xiaoyan Hong +3 more
openaire +1 more source
Establishing trust in vehicular networks is a critical but also difficult task. In this position paper, we present a new trust architecture and model - Situation-Aware Trust (SAT) - to address several important trust issues in vehicular networks that we believe are essential to overcome the weaknesses of the current vehicular network security and trust
Xiaoyan Hong +3 more
openaire +1 more source
Community Structure Inspired Algorithms for SAT and #SAT
2015We introduce h-modularity, a structural parameter of CNF formulas, and present algorithms that render the decision problem SAT and the model counting problem #SAT fixed-parameter tractable when parameterized by h-modularity. The new parameter is defined in terms of a partition of clauses of the given CNF formula into strongly interconnected communities
Robert Ganian, Stefan Szeider
openaire +1 more source
Natural Max-SAT Encoding of Min-SAT
2012We show that there exists a natural encoding which transforms Min-SAT instances into Max-SAT instances. Unlike previous encodings, this natural encoding keeps the same variables, and the optimal assignment for the Min-SAT instance is identical to the optimal assignment of the corresponding Max-SAT instance.
openaire +1 more source
Generalized SAT-Attack-Resistant Logic Locking
IEEE Transactions on Information Forensics and Security, 2021Jingbo Zhou, Xinmiao Zhang
exaly
High selectivity detection of FMDV- SAT-2 using a newly-developed electrochemical nanosensors
Biosensors and Bioelectronics, 2021Heba A Hussein +2 more
exaly