Search alternatives:
bayesian optimization » based optimization (Expand Search)
art optimization » swarm optimization (Expand Search), after optimization (Expand Search), path optimization (Expand Search)
data bayesian » a bayesian (Expand Search), art bayesian (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
based art » based care (Expand Search)
bayesian optimization » based optimization (Expand Search)
art optimization » swarm optimization (Expand Search), after optimization (Expand Search), path optimization (Expand Search)
data bayesian » a bayesian (Expand Search), art bayesian (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
based art » based care (Expand Search)
-
1
Optimized Bayesian regularization-back propagation neural network using data-driven intrusion detection system in Internet of Things
Published 2025“…This research presents Data-Driven Intrusion Detection System in Internet of Things utilizing Optimized Bayesian Regularization-Back Propagation Neural Network (DIDS-BRBPNN-BBWOA-IoT) to overcome these issues. …”
-
2
-
3
-
4
-
5
Bayesian sequential design for sensitivity experiments with hybrid responses
Published 2023“…To deal with the problem of complex computation involved in searching for optimal designs, fast algorithms are presented using two strategies to approximate the optimal criterion, denoted as SI-optimal design and Bayesian D-optimal design, respectively. …”
-
6
Analysis and design of algorithms for the manufacturing process of integrated circuits
Published 2023“…The (approximate) solution proposals of state-of-the-art methods include rule-based approaches, genetic algorithms, and reinforcement learning. …”
-
7
datasheet1_Graph Neural Networks for Maximum Constraint Satisfaction.pdf
Published 2021“…Despite being generic, we show that our approach matches or surpasses most greedy and semi-definite programming based algorithms and sometimes even outperforms state-of-the-art heuristics for the specific problems.…”
-
8