Results 51 to 60 of about 18,622 (181)

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

Hiding Satisfying Assignments: Two are Better than One [PDF]

, 2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k-SAT formulas whose clauses are chosen uniformly from among all clauses ...
Achlioptas, Dimitris, Jia, Haixia, Moore, Cristopher   +2 more
core   +2 more sources

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

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

Investigating the Impact of p-Bit Non-Idealities on Solving Complex Optimization Problems

IEEE Access
We perform a simulation study to effectively utilize SiOx-based threshold switching (TS) devices as probabilistic bits (p-Bits) for solving complex optimization problems (COPs), providing design guidelines for p-Bit development.
Jihyun Kim, Hyeonsik Choi, Jiyong Woo
doaj   +1 more source

Extending the Wave Telescope Technique to Larger Numbers of Spacecraft Obtaining Robust Spatial Power Spectra

Journal of Geophysical Research: Space Physics, Volume 131, Issue 3, March 2026.
Abstract The wave telescope is an analysis technique for multi‐point spacecraft data that estimates power spectra in reciprocal position space (k $k$‐space). It has been used to reveal the spatial properties of waves and fluctuations in space plasmas. Originally designed as an analysis tool for 4 spacecraft constellations, new multi‐scale missions such
L. Schulz, K.‐H. Glassmeier, L. Turc, F. Plaschke, K. G. Klein, M. Palmroth, O. W. Roberts, Y. Narita   +7 more
wiley   +1 more source

Spintronics-compatible Approach to Solving Maximum-Satisfiability Problems with Probabilistic Computing, Invertible Logic, and Parallel Tempering [PDF]

, 2022
Andrea Grimaldi, Luis Sánchez-Tejerina, Navid Anjum Aadit, Stefano Chiappini, Mario Carpentieri, Kerem Y. Çamsarı, Giovanni Finocchio   +6 more
openalex   +1 more source

Adaptive Hybrid Chance‐Constrained SOCP‐Based ACOPF for Coordinated Optimisation of Integrated Energy Systems

IET Smart Energy Systems, Volume 2, Issue 1, Page 34-48, March 2026.
An adaptive chance‐constrained hybrid SOCP‐Based ACOPF for coordinated optimisation of integrated source–grid–load–storage systems is presented. The coordinated optimisation of integrated source–grid–load–storage (SGLS) systems is challenged by renewable energy uncertainty, complex industrial load characteristics and stringent policy constraints ...
Mingyue He, Zhengxiang Song, Jun Yang, Shaohua Zhang, Ya Mou, Zhongxia Zhang, Jiaqi Wu   +6 more
wiley   +1 more source

High-Performance and Reliable Probabilistic Ising Machine Based on Simulated Quantum Annealing

Physical Review X
Probabilistic computing with p-bits is emerging as a computational paradigm for machine learning and for facing combinatorial optimization problems (COPs) with the so-called probabilistic Ising machines (PIMs).
Eleonora Raimondo, Esteban Garzón, Yixin Shao, Andrea Grimaldi, Stefano Chiappini, Riccardo Tomasello, Noraica Davila-Melendez, Jordan A. Katine, Mario Carpentieri, Massimo Chiappini, Marco Lanuzza, Pedram Khalili Amiri, Giovanni Finocchio   +12 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