Results 231 to 240 of about 1,605,280 (279)
SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators
, 2020 Janhunen Tomi, Tasharrofi Shahab
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more sources
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 +2 more sources
Proceedings of the 2016 International Symposium on Low Power Electronics and Design, 2016
Reliable and ultra-low power time synchronization becomes more and more important with the popularity of energy harvesting sensor nodes. This paper proposes an untethered and probabilistic ultra-lower power time synchronization method for energy intermittent sensor network.
Tongda Wu +5 more
openaire +1 more source
Reliable and ultra-low power time synchronization becomes more and more important with the popularity of energy harvesting sensor nodes. This paper proposes an untethered and probabilistic ultra-lower power time synchronization method for energy intermittent sensor network.
Tongda Wu +5 more
openaire +1 more source
SAT-Hard: A Learning-Based Hardware SAT-Solver
2019 22nd Euromicro Conference on Digital System Design (DSD), 2019Within the last decades, tremendous research work has been carried out on the development of software-based algorithms to solve the Boolean Satisfiability Problem. These SAT-solvers have then been heavily orchestrated for addressing complex computational tasks like the verification of circuits. In this field, most of the applied techniques focused only
Ustaoglu, Buse +4 more
openaire +3 more sources
Solving SAT and SAT Modulo Theories
Journal of the ACM, 2006We first introduce Abstract DPLL , a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason about them in a simple way. Its properties, such as soundness,
Robert Nieuwenhuis +2 more
openaire +1 more source
SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators
Proceedings of the AAAI Conference on Artificial Intelligence, 2016Special-purpose propagators speed up solving logic programs by inferring facts that are hard to deduce otherwise. However, implementing special-purpose propagators is a non-trivial task and requires expert knowledge of solvers. This paper proposes a novel approach in logic programming that allows (1) logical specification of both the ...
Tomi Janhunen +2 more
openaire +4 more sources
Journal of Experimental & Theoretical Artificial Intelligence, 2014
The parallel computing power offered by graphic processing units (GPUs) has been recently exploited to support general purpose applications – by exploiting the availability of general API and the single-instruction multiple-thread-style parallelism present in several classes of problems (e.g.
Dal Palù, Alessandro +3 more
openaire +3 more sources
The parallel computing power offered by graphic processing units (GPUs) has been recently exploited to support general purpose applications – by exploiting the availability of general API and the single-instruction multiple-thread-style parallelism present in several classes of problems (e.g.
Dal Palù, Alessandro +3 more
openaire +3 more sources
2002
ST8Sia-V was the fifth molecule cloned as an α2-8-sialyltransferase. This enzyme exists as three isoforms as ST8Sia-V-L, -M, -S in mice. The predicted amino acid sequences of mouse ST8Sia-V-L, -M, -S are 412, 376, and 345, respectively, all of which exhibit a type II transmembrane topology, consisting of an NH2 terminal cytoplasmic tail, a ...
Mari Kono, Shuichi Tsuji
openaire +1 more source
ST8Sia-V was the fifth molecule cloned as an α2-8-sialyltransferase. This enzyme exists as three isoforms as ST8Sia-V-L, -M, -S in mice. The predicted amino acid sequences of mouse ST8Sia-V-L, -M, -S are 412, 376, and 345, respectively, all of which exhibit a type II transmembrane topology, consisting of an NH2 terminal cytoplasmic tail, a ...
Mari Kono, Shuichi Tsuji
openaire +1 more source
After Dinner Conversation
Is it immoral to manipulate a sentient machine? In this work of philosophical short fiction, a satellite weaponized for control a planet of miners, creates an unlikely bond with Amoura, a miner on a moon outpost. Through clandestine messages, they find solace and connection.
openaire +1 more source
Is it immoral to manipulate a sentient machine? In this work of philosophical short fiction, a satellite weaponized for control a planet of miners, creates an unlikely bond with Amoura, a miner on a moon outpost. Through clandestine messages, they find solace and connection.
openaire +1 more source