Results 51 to 60 of about 770 (181)
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
Financial distress prediction demands models that balance complex pattern recognition with interpretable decision logic. This study reframes the prediction task as a Boolean satisfiability (SAT) problem and introduces a hybrid neurosymbolic framework, Hopfield neural network (HNN)–RANkSATRA, that integrates HNNs with metaheuristic optimization to ...
Hamza Abubakar +3 more
wiley +1 more source
Generalizing Boolean Satisfiability II: Theory
This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the ...
Heidi E. Dixon +3 more
openaire +4 more sources
Enhancing Quantum Approximate Optimization Algorithm Through Manifold Optimization
We propose the models of Riemannian manifold optimization techniques to enhance the performance of the quantum approximate optimization algorithm (QAOA) for combinatorial optimization problems on near‐term quantum devices. The approach leverages the intrinsic geometric structure of the problem domain, addressing the nonconvexity of the QAOA objective ...
Qingqing Yu +3 more
wiley +1 more source
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over a classical standalone simulated annealing (SA). This scatter plot represents the comparison of QESA versus SA for the 924 graphs with the sizes N=60$N=60$, 80 and ...
Seokho Jeong, Juyoung Park, Jaewook Ahn
wiley +1 more source
Computing discrete logarithm by interval-valued paradigm [PDF]
Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure.
Benedek Nagy, Sándor Vályi
doaj +1 more source
The Boolean Satisfiability Problem is also the first problem proven to be NP-complete. A problem is NP-complete if it belongs to the set (or "class" if you prefer) of the hardest problems in NP-hardest in the sense that every problem ever exists in NP can be reduced to them. (Thus being able to solve a NP-complete problem is equivalent to being able to
openaire +1 more source
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
The Boolean SATisfiability Problem in Clifford algebra [PDF]
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
openaire +3 more sources
A Validation Methodology for XAI Decision Support Systems Against Relational Domain Properties
ABSTRACT The global adoption of artificial intelligence (AI) has increased dramatically in recent years, becoming commonplace in many fields. Such a pervasiveness has led to changes in how AI is perceived, strengthening discussions on its societal consequences. Thus, a new class of requirements for AI‐based solutions emerged. Broadly speaking, those on
Emanuele De Angelis +3 more
wiley +1 more source

