Results 101 to 110 of about 62,255 (228)

Leveraging Quantum Annealing for Layout Optimization

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 11, November 2025.
The authors address wind farm layout optimization by formulating it as a QUBO problem using the Jensen wake model. They compare quantum annealing, Gurobi, and QAOA, highlighting trade‐offs between solution quality and computational time. Results show that quantum annealing offers rapid, near‐optimal solutions, making it suitable for fast approximations
Luca Nigro   +3 more
wiley   +1 more source

Generalized Satisfiability Problems via Operator Assignments

open access: yes, 2017
Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used
A Acín   +12 more
core   +1 more source

Design, Fabrication, Mechanics, and Multifunctional Applications of Shell‐Based Nanoarchitected Materials

open access: yesSmall Structures, Volume 6, Issue 11, November 2025.
Shell‐based nanoarchitected materials feature continuous surfaces, nanoscale feature sizes, and strong constituent materials, and exhibit high modulus/strength, remarkable recoverability, and substantial energy absorption capacity. This review provides an overview of recent progresses in shell‐based nanoarchitected materials from the perspectives of ...
Hanzheng Xing   +9 more
wiley   +1 more source

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

open access: yesNew Journal of Physics, 2016
We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists ...
Salvatore Mandrà   +2 more
doaj   +1 more source

Automata Linear Dynamic Logic on Finite Traces [PDF]

open access: yesLogical Methods in Computer Science
Temporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj   +1 more source

Moderate Structural Exploitation

open access: yesJournal of Applied Philosophy, Volume 42, Issue 5, Page 1454-1475, November 2025.
ABSTRACT We consider the apparent inability of theories of exploitation to capture common intuitions about structural exploitation. For example, it seems that consumers participate in the exploitation of sweatshop workers, but there is no direct transaction between the parties. This poses a problem for transactional accounts of exploitation.
Benjamin Ferguson   +1 more
wiley   +1 more source

Model Checking Dynamic-Epistemic Spatial Logic [PDF]

open access: yes, 2006
In this paper we focus on Dynamic Spatial Logic, the extension of Hennessy-Milner logic with the parallel operator. We develop a sound complete Hilbert-style axiomatic system for it comprehending the behavior of spatial operators in relation with dynamic/
Mardare, Radu, Priami, Corrado
core  

Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability

open access: yes, 2018
A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. We study phase transition in a context of matched formulas and their generalization of biclique satisfiable formulas.
B Bollobás   +7 more
core   +1 more source

Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions

open access: yesScientific Reports, 2018
Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe   +2 more
doaj   +1 more source

On the Satisfiability of Local First-Order Logics with Data [PDF]

open access: yesLogical Methods in Computer Science
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality.
Benedikt Bollig   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy