Frequent itemset-driven search for finding minimal node separators and its application to air transportation network analysis
The-separator problem (-SP) consists of finding the minimum set of vertices whose removal
separates the network into multiple different connected components with fewer than a limited …
separates the network into multiple different connected components with fewer than a limited …
Hybrid Nelder–Mead algorithm and dragonfly algorithm for function optimization and the training of a multilayer perceptron
J Xu, F Yan - Arabian Journal for Science and Engineering, 2019 - Springer
Dragonfly algorithm (DA) is a new optimization technique based on swarm intelligence. DA
simulates the static and dynamic swarming behaviors of dragonflies in nature. The search …
simulates the static and dynamic swarming behaviors of dragonflies in nature. The search …
Optimization of compressor standby schemes for gas transmission pipeline systems based on gas delivery reliability
To guarantee the gas delivery reliability of a gas pipeline system, some standby compressor
units or standby powers are typically installed in a compressor station. A reasonable …
units or standby powers are typically installed in a compressor station. A reasonable …
Physics-informed neural network for first-passage reliability assessment of structural dynamic systems
Z Bai, S Song - Computers & Structures, 2023 - Elsevier
The first-passage failure of structural dynamic systems is a typical failure mode in
engineering. Most of the existing methods use ordinary or partial differential equations …
engineering. Most of the existing methods use ordinary or partial differential equations …
A reliability evaluation method for complex systems based on the editable GSPN and adaptive Monte Carlo simulation
Y Zeng, Y Sun, T Xu, S Su - Systems Engineering, 2024 - Wiley Online Library
This paper presents an innovative EGSPN (Editable Generalized Stochastic Petri Net)
model, optimizing the size of GSPN (Generalized Stochastic Petri Net) while preserving its …
model, optimizing the size of GSPN (Generalized Stochastic Petri Net) while preserving its …
Finding weaknesses in networks using greedy randomized adaptive search procedure and path relinking
In recent years, the relevance of cybersecurity has been increasingly evident to companies
and institutions, as well as to final users. Because of that, it is important to ensure the …
and institutions, as well as to final users. Because of that, it is important to ensure the …
Convexity hierarchies in grid networks
J Blum, R Li, S Storandt - … of the International Conference on Automated …, 2023 - ojs.aaai.org
Several algorithms for path planning in grid networks rely on graph decomposition to reduce
the search space size; either by constructing a search data structure on the components, or …
the search space size; either by constructing a search data structure on the components, or …
[图书][B] Intelligent Data Engineering and Automated Learning--IDEAL 2018
This year saw the 19th edition of the International Conference on Intelligent Data
Engineering and Automated Learning (IDEAL), which has been playing an increasingly …
Engineering and Automated Learning (IDEAL), which has been playing an increasingly …
Detecting weak points in networks using variable neighborhood search
Recent advances in networks technology require from advanced technologies for monitoring
and controlling weaknesses in networks. Networks are naturally dynamic systems to which a …
and controlling weaknesses in networks. Networks are naturally dynamic systems to which a …
A Metaheuristic Approach for the -separator Problem
Most of the critical infrastructures can be easily modeled as a network of nodes
interconnected among them. If one or more nodes of the network fail, the connectivity of the …
interconnected among them. If one or more nodes of the network fail, the connectivity of the …