Results 81 to 90 of about 62,255 (228)
Engineering Reports, Volume 8, Issue 2, February 2026.Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
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
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
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
, 2006 We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a result recently obtained by Y.
Pratt-Hartmann, Ian
core +1 more source
Advanced Intelligent Systems, Volume 8, Issue 1, January 2026.This perspective article considers what computations optical computing can and should enable. Focusing upon free‐space optical computing, it argues that a codesign approach whereby materials, devices, architectures, and algorithms are simultaneously optimized is needed.
Prasad P. Iyer +6 more
wiley +1 more source
Complexity results for modal logic with recursion via translations and tableaux [PDF]
Logical Methods in Computer ScienceThis 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 +4 more
doaj +1 more source
Advanced Engineering Materials, Volume 27, Issue 24, December 2025.The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley +1 more source
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder [PDF]
Logical Methods in Computer ScienceTemporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace ...
Marie Fortin +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. +4 more
core +1 more source
Impact of System‐Model Mismatch in Fourier Ptychographic Microscopy
Advanced Photonics Research, Volume 6, Issue 12, December 2025.This study investigates the robustness of Fourier ptychography microscope (FPM) reconstruction algorithms across various scenarios, each representing challenges encountered in practical FPM experiments, and deduces the extent to which FPM can provide diffraction‐limited resolution under the influence of various sources of error.
Tuo Yin +4 more
wiley +1 more source