Results 81 to 90 of about 12,229,216 (240)

Robust Control Design and Analysis Based on Lifting Linearization of Nonlinear Systems Under Uncertain Initial Conditions

International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 3047-3067, 25 March 2026.
ABSTRACT This paper presents a robust control synthesis and analysis framework for nonlinear systems with uncertain initial conditions. First, a deep learning‐based lifting approach is proposed to approximate nonlinear dynamical systems with linear parameter‐varying (LPV) state‐space models in higher‐dimensional spaces while simultaneously ...
Sourav Sinha, Mazen Farhood
wiley   +1 more source

Statistical Mechanics of the Quantum K-Satisfiability problem

, 2008
We study the quantum version of the random $K$-Satisfiability problem in the presence of the external magnetic field $\Gamma$ applied in the transverse direction.
A. Messiah, A. Percus, B. Bollobás, B. K. Chakrabarti, D. Achlioptas, H. Niederreiter, J. Zinn-Justin, M. Mézard, M. Mézard, M. R. Garey, S. Sachdev, Sergey Knysh, Vadim N. Smelyanskiy, W. H. Press, W. T. Eadie, W. Van Dam   +15 more
core   +1 more source

Efficient Scheduling Algorithms for Multicore Cyclic Executives With Precedence and Exclusion Relations

Concurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.
ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira, Alfredo Lima, Eduardo Tavares, Rodrigo Paes, Francisco Airton Silva   +4 more
wiley   +1 more source

Quantum programming of the satisfiability problem with Rydberg atom graphs

Physical Review Research, 2023
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the
Seokho Jeong, Minhyuk Kim, Minki Hhan, JuYoung Park, Jaewook Ahn   +4 more
doaj   +1 more source

On product, generic and random generic quantum satisfiability

, 2010
We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiability
Laumann, C. R., Läuchli, A. M., Moessner, R., Scardicchio, A., Sondhi, S. L.   +4 more
core   +1 more source

Perfect Matching Under Precedence Constraints

Networks, Volume 87, Issue 2, Page 175-190, March 2026.
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
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, Weixiang WANG, Yahui LU, Mingwei WU, Zhijun ZHENG, Fahong YU   +5 more
doaj   +2 more sources

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

Scientific 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, Chamika Liyanagedera, Kaushik Roy   +2 more
doaj   +1 more source

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder [PDF]

Logical Methods in Computer Science
Temporal 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, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann   +3 more
doaj   +1 more source

Timed Context-Free Temporal Logics [PDF]

Electronic Proceedings in Theoretical Computer Science, 2018
The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-free ...
Laura Bozzelli, Aniello Murano, Adriano Peron   +2 more
doaj   +1 more source