Results 81 to 90 of about 21,948 (228)
Spatial transcriptomics in epilepsy research: Early successes, opportunities, and challenges
Epilepsia, EarlyView.
Donald J. Phillips +4 more
wiley +1 more source
IET Software, Volume 2026, Issue 1, 2026.Quantum computing is one of the research areas progressing rapidly toward practical deployment, yet the engineering of scalable and reliable quantum software remains underdeveloped. Current quantum software engineering (QSE) practices are largely tools‐driven and ad hoc that providing limited support for managing probabilistic execution, hybrid quantum–
Hessa Alfraihi +7 more
wiley +1 more source
The Journal of Engineering, 2023 Travelling salesman problem (TSP) is one of the most famous problems in graph theory, as well as one of the typical nondeterministic polynomial time (NP)‐hard problems in combinatorial optimization. Reinforcement learning (RL) has been widely regarded as
Jiaying Wang +3 more
doaj +1 more source
Journal of Product Innovation Management, Volume 43, Issue 1, Page 125-159, January 2026.ABSTRACT Artificial intelligence (AI) technologies have gained significance for all types of firms, including family firms. However, unlike other business contexts, family firms face unique challenges in adopting complex and generative technologies, such as AI.
Jonas Soluk +2 more
wiley +1 more source
One-Tape Turing Machine Variants and Language Recognition
, 2015 We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d ...
Pighizzini, Giovanni
core +1 more source
Advances in Civil Engineering, Volume 2026, Issue 1, 2026.To investigate the relationship between load, damage, and fatigue life of complex engineering components under stress, this paper modifies the existing continuous nonlinear damage model based on the distortion energy density theory to reflect the usage and stress characteristics of Q345 steel components in bridges.
Yonzhi Lin +7 more
wiley +1 more source
A Robust Robotic Disassembly Sequence Design Using Orthogonal Arrays and Task Allocation
Robotics, 2019 Disassembly sequence planning (DSP) is a nondeterministic polynomial time (NP) complete problem, making the utilization of metaheuristic approaches a viable alternative.
Mohammad Alshibli +4 more
doaj +1 more source
Characterizing PSPACE with Shallow Non-Confluent P Systems [PDF]
, 2018 In P systems with active membranes, the question of understanding the power of non-confluence within a polynomial time bound is still an open problem.
Leporati, Alberto +4 more
core
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
B\"uchi Complementation and Size-Change Termination [PDF]
Logical Methods in Computer Science, 2012 We compare tools for complementing nondeterministic B\"uchi automata with a recent termination-analysis algorithm. Complementation of B\"uchi automata is a key step in program verification.
Seth Fogarty, Moshe Y. Vardi
doaj +1 more source