Results 61 to 70 of about 18,622 (181)

Mapping Quantum Computing Techniques for NP‐Hard Problems in Operations Management and Operations Research

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, Patricia Gomes Ferreira da Costa, Thaís Spiegel, Hélcio de Oliveira Rocha   +3 more
wiley   +1 more source

Lagrange oscillatory neural networks for constraint satisfaction and optimization

Neuromorphic Computing and Engineering
Physics-inspired computing paradigms are receiving renewed attention to enhance efficiency in compute-intensive tasks such as artificial intelligence and optimization.
Corentin Delacour, Bram Haverkort, Filip Sabo, Nadine Azemard, Aida Todri-Sanial   +4 more
doaj   +1 more source

Towards Understanding Reasoning Complexity in Practice [PDF]

, 2011
Although the computational complexity of the logic underlying the standard OWL 2 for the Web Ontology Language (OWL) appears discouraging for real applications, several contributions have shown that reasoning with OWL ontologies is feasible in practice ...
Martín-Recuerda Moyano, Francisco, Walther, Dirk   +1 more
core   +1 more source

Is Computing with Light All You Need? A Perspective on Codesign for Optical Artificial Intelligence and Scientific Computing

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, Gaurang R. Bhatt, Saaketh Desai, Elliot J. Fuller, Corinne M. Teeter, François Léonard, Craig M. Vineyard   +6 more
wiley   +1 more source

Enhancing Quantum Approximate Optimization Algorithm Through Manifold Optimization

Quantum Engineering, Volume 2026, Issue 1, 2026.
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, Yinhui Yu, Rong Jin, Srijoni Sengupta   +3 more
wiley   +1 more source

Energy‐Efficient Knapsack Optimization Using Probabilistic Memristor Crossbars

Advanced Intelligent Systems, Volume 7, Issue 12, December 2025.
The knapsack problem, a nondeterministic polynomial‐time (NP)‐hard combinatorial optimization problem, is solved energy‐efficiently. This work presents an algorithm‐hardware co‐design and implementation for practical (non‐ideal) NP‐hard problems with destabilizing self‐feedback (non‐zero diagonal) and non‐binary Hamiltonian representations under analog
Jinzhan Li, Suhas Kumar, Su‐in Yi
wiley   +1 more source

Parameterized Exact and Approximation Algorithms for Maximum $k$-Set Cover and Related Satisfiability Problems [PDF]

, 2013
Édouard Bonnet, Vangélis Th. Paschos, Florian Sikora   +2 more
openalex   +2 more sources

What makes a phase transition? Analysis of the random satisfiability problem

, 2010
In the last 30 years it was found that many combinatorial systems undergo phase transitions. One of the most important examples of these can be found among the random k-satisfiability problems (often referred to as k-SAT), asking whether there exists an ...
Bollobás, Bollobás, Cheeseman, Chvátal, Davis, Elser, Garey, Gergely Palla, Hartmann, Katharina A. Zweig, Kirkpatrick, Krakala, Kropf, Marques-Silva, Marques-Silva, Mezárd, Mezárd, Mitchell, Monasson, Monasson, Monasson, Sinz, Stauffer, Tamás Vicsek   +23 more
core   +2 more sources

Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms

Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.
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

Practical Reasoning for Very Expressive Description Logics

, 1999
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones.
Horrocks, Ian, Sattler, Ulrike, Tobies, Stephan   +2 more
core   +6 more sources