Search alternatives:
method algorithm » network algorithm (Expand Search), means algorithm (Expand Search), mean algorithm (Expand Search)
code algorithm » cosine algorithm (Expand Search), novel algorithm (Expand Search), modbo algorithm (Expand Search)
based solution » based solutions (Expand Search), based selection (Expand Search)
data code » data model (Expand Search), data came (Expand Search)
element » elements (Expand Search)
method algorithm » network algorithm (Expand Search), means algorithm (Expand Search), mean algorithm (Expand Search)
code algorithm » cosine algorithm (Expand Search), novel algorithm (Expand Search), modbo algorithm (Expand Search)
based solution » based solutions (Expand Search), based selection (Expand Search)
data code » data model (Expand Search), data came (Expand Search)
element » elements (Expand Search)
-
201
-
202
Code and data for <i>Navigating Time's Possibilities: Plausible Counterfactual Explanations for Multivariate Time-Series Forecast through Genetic Algorithms</i>
Published 2024“…<p dir="ltr">Data and code for easy reproducibility of results described in the paper <i>Navigating Time's Possibilities: Plausible Counterfactual Explanations for Multivariate Time-Series Forecast through Genetic Algorithms</i><i>, </i>published on the IEEE TrustCom-2024 (23rd IEEE International Conference on Trust, Security and Privacy in Computing and Communications).…”
-
203
-
204
-
205
-
206
-
207
-
208
Solution obtained by NSGA-II (Instance #2).
Published 2025“…Given the NP-hard nature of the problem, a location allocation method based on minimum envelope clustering analysis is employed, and an improved NSGA-II algorithm incorporating a fast non-dominated sorting mechanism is designed to obtain Pareto optimal solutions. …”
-
209
Solution obtained by NSGA-II (Instance #1).
Published 2025“…Given the NP-hard nature of the problem, a location allocation method based on minimum envelope clustering analysis is employed, and an improved NSGA-II algorithm incorporating a fast non-dominated sorting mechanism is designed to obtain Pareto optimal solutions. …”
-
210
-
211
-
212
-
213
-
214
-
215
-
216
-
217
-
218
-
219
-
220