Results 71 to 80 of about 44,520 (208)

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, Tao WANG, Shi-ze GUO, Xin-jie ZHAO, Hui-ying LIU   +4 more
doaj  

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, Marco Roveri, Angelo Susi, Stefano Tonetta   +3 more
doaj   +1 more source

Clustering in Hilbert space of a quantum optimization problem

, 2017
The solution space of many classical optimization problems breaks up into clusters which are extensively distant from one another in the Hamming metric.
Hsu, B., Laumann, C. R., Moessner, R., Morampudi, S. C., Sondhi, S. L.   +4 more
core   +1 more source

Engineering Binary Metal Oxide Nano‐Oscillators for Deterministic and Probabilistic Computing: From Material Physics to Emerging Paradigms

Advanced Physics Research, Volume 5, Issue 5, May 2026.
This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim, Jaehyun Moon, Seung‐Youl Kang, Jiyong Woo   +3 more
wiley   +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, Michael Lampis, Valia Mitsou   +2 more
openaire   +4 more sources

ROBUSTNESS EVALUATION OF THE 3-SATISFIABILITY REVERSE ANALYSIS METHOD WITH DISCRETE HOPFIELD NEURAL NETWORK AND GENETIC ALGORITHM FOR TRAFFIC FLOW DATASET

Barekeng
Traffic flow congestion is a pervasive global phenomenon. Nonetheless, the systematic analysis and identification of traffic flow patterns remain a challenge as the volume of traffic data increases.
Amierah Abdul Malik, Mohd. Asyraf Mansor, Nur Ezlin Zamri, Nurul Atiqah Romli   +3 more
doaj   +1 more source

Classical and quantum satisfiability [PDF]

Electronic Proceedings in Theoretical Computer Science, 2012
We present the linear algebraic definition of QSAT and propose a direct logical characterization of such a definition. We then prove that this logical version of QSAT is not an extension of classical satisfiability problem (SAT).
Anderson de Araújo, Marcelo Finger
doaj   +1 more source

A Contextual Accuracy Dominance Argument for Probabilism

Philosophy and Phenomenological Research, Volume 112, Issue 3, Page 594-607, May 2026.
ABSTRACT A central motivation for Probabilism—the principle of rationality that requires one to have credences that satisfy the axioms of probability—is the accuracy dominance argument: one should not have accuracy dominated credences, and one avoids accuracy dominance just in case one satisfies Probabilism.
Mikayla Kelley
wiley   +1 more source

Complexity results for modal logic with recursion via translations and tableaux [PDF]

Logical Methods in Computer Science
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations
Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir   +4 more
doaj   +1 more source

Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation

Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.
ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini, Dimos Tsouros, Bistra Dilkina, Tias Guns   +3 more
wiley   +1 more source