Results 61 to 70 of about 1,567 (182)
Satisfiability in MultiValued Circuits [PDF]
SIAM Journal on Computing, 2018 50 ...
Pawel M. Idziak, Jacek Krzaczkowski
openaire +4 more sources
Philosophy and Phenomenological Research, EarlyView.ABSTRACT Recent philosophical work on pain distinguishes a variety of pain qualities and the mechanisms that give rise to them, but pain intensity remains a monolithic notion difficult to account for in reductive terms. The reason for this difficulty is that pain intensity is not a unitary phenomenal magnitude; pain is a complex experience featuring ...
Kim Soland
wiley +1 more source
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 The restricted Maximum k-Satisfiability MAX- kSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization
Mohd Shareduwan Bin Mohd Kasihmuddin +2 more
doaj +1 more source
Formalization and Validation of Safety-Critical Requirements [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The validation of requirements is a fundamental step in the development process of safety-critical systems. In safety critical applications such as aerospace, avionics and railways, the use of formal methods is of paramount importance both for ...
Alessandro Cimatti +3 more
doaj +1 more source
The Southern Journal of Philosophy, EarlyView.Abstract This article reinterprets Levinas's account of ethical subjectivity by centering the temporality of the pas encore (“not yet”) and drawing on new materials in Œuvres complètes. I argue that, in Totality and Infinity, eros and ethics are internally continuous: eros generates a responsible not yet of time, secured by fecundity and oriented to ...
Huaiyuan Zhang
wiley +1 more source
Counting workflow satisfiability with exclusion constraints based on backtracking tree-decomposition
Dianxin kexue, 2016 Workflow satisfiability（WS）concerns the issue of resource allocation under some access control policies. Counting all its solutions is advantaged to verify the robustness of a workflow to resource exceptions.
Zhinian ZHAI +5 more
doaj +2 more sources
Research of Hamming weight-based algebraic side-channel attack on LED
Tongxin xuebao, 2013 :The security of LED against the algebraic side-channel attack (ASCA)was evaluated, which is a lightweight block cipher proposed in CHES 2011.Firstly, the attack model of ASCA was analyzed, and then the design and algebraic representations of LED were ...
Ke-ke JI +4 more
doaj
Timed Context-Free Temporal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-free ...
Laura Bozzelli +2 more
doaj +1 more source
Satisfiability at Microsoft [PDF]
, 2011 Constraint satisfaction problems arise in many diverse areas including software and hardware verification, type inference, static program analysis, test-case generation, scheduling, planning and graph problems. These areas share a common trait, they include a core component using logical formulas for describing states and transformations between them ...
openaire +1 more source
Parameterized Modal Satisfiability
Algorithmica, 2010 We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem's combinatorial explosion, beyond the number of propositional variables v. To this end we study the modality depth, a natural measure which has appeared in the literature,
Antonis Achilleos +2 more
openaire +4 more sources