Results 181 to 190 of about 55,873 (316)

On the Complexity of the Bilevel Shortest Path Problem

open access: yesNetworks, EarlyView.
ABSTRACT We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our problem, the leader and the follower each control a subset of the edges of a graph and together aim at building a path between two given vertices, while each of the ...
Dorothee Henke, Lasse Wulf
wiley   +1 more source

A Critical Review of Pole Clustering Techniques: Common Pitfalls, Extension to MIMO and New Enhanced Variant of the Cuckoo Search Algorithm

open access: yesOptimal Control Applications and Methods, EarlyView.
Enhanced Cuckoo Search for Model Order Reduction ABSTRACT This article presents a critical review of classical and modern pole clustering techniques for model order reduction in high‐order systems. It highlights key limitations and common pitfalls encountered in traditional approaches, especially when extended to Multi‐Input Multi‐Output (MIMO) systems.
Kamel Ben Slimane   +2 more
wiley   +1 more source

Topological prethermal strong zero modes on superconducting processors. [PDF]

open access: yesNature
Jin F   +44 more
europepmc   +1 more source

Role of the DPP4 Receptor in SARS‐CoV Entry: Insights From Docking and Molecular Dynamics Simulations

open access: yesProteins: Structure, Function, and Bioinformatics, EarlyView.
ABSTRACT Protein–receptor interactions play a critical role in viral entry and pathogenesis. While ACE2 is the primary receptor for SARS‐CoV, the role of DPP4 as potential coreceptor remains underexplored. This study investigates the binding mechanisms and dissociation dynamics of the SARS‐CoV/DPP4, SARS‐CoV/ACE2 and MERS‐CoV/DPP4 complexes using ...
Patrícia Pereira Duzi Carvalho   +1 more
wiley   +1 more source

A generalization of Hamiltonian cycles for trees [PDF]

open access: yesCzechoslovak Mathematical Journal, 1976
openaire   +1 more source

Home - About - Disclaimer - Privacy