Results 51 to 60 of about 73,753 (309)
On Optimistic and Pessimistic Bilevel Optimization Models for Demand Response Management
This paper investigates bilevel optimization models for demand response management, and highlights the often overlooked consequences of a common modeling assumption in the field.
Tamás Kis +2 more
doaj +1 more source
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source
A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational ...
Thomas Schuster +3 more
doaj +1 more source
An Improved Coppersmith Algorithm Based on Block Preprocessing
Since Coppersmith proposed the use of the LLL algorithm to solve univariate modular polynomial equations at EUROCRYPT’96, it has sparked a fervent research interest in lattice analysis among cryptographers.
Lu Zhang +3 more
doaj +1 more source
Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds [PDF]
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms.
Maciej Gazda, Tim A.C. Willemse
doaj +1 more source
Unification Algorithms Cannot Be Combined in Polynomial Time
We establish that there is no polynomial-time general combination algorithm for unification in finitary equational theories, unless the complexity class #P of counting problems is contained in the class FP of function problems solvable in polynomial-time. The prevalent view in complexity theory is that such a collapse is extremely unlikely for a number
Hermann, Miki, Kolaitis, Phokion G.
openaire +2 more sources
Parity Games: Zielonka’s Algorithm in Quasi-Polynomial Time [PDF]
Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time algorithm solving parity games. After this breakthrough result, a few other quasi-polynomial-time algorithms were introduced; none of them is easy to understand. Moreover,
Parys, Paweł
core +1 more source
Mechanoluminescent HOF Nanotransducers Enabled Sono‐Optogenetics in Parkinsonian Rats
We present a mechanoluminescent system utilizing porous hydrogen‐bonded organic frameworks (HOFs) as a toolkit for focused ultrasound‐triggered, non‐invasive light delivery to the deep brain in rats. This approach enables the specific activation of PV‐GPe neurons in dopamine‐depleted Parkinson's disease rat models, resulting in a comparable alleviation
Wenliang Wang +18 more
wiley +1 more source
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Multi-threshold algorithm about image segmentation based on polynomial uniform approximation
Aiming at those shortcomings of previous multi-threshold image segmentation algorithm such as large complexity and instability caused by the image histogram glitch interference,a new multi-threshold image segmentation algorithm was proposed using ...
Yan-jun WEI, Bo-qin FENG, Wei-guo WU
doaj +2 more sources

