Results 191 to 200 of about 151,418 (244)
Some of the next articles are maybe not open access.

An Investigation of SMOTE Based Methods for Imbalanced Datasets With Data Complexity Analysis

IEEE Transactions on Knowledge and Data Engineering, 2023
Many binary class datasets in real-life applications are affected by class imbalance problem. Data complexities like noise examples, class overlap and small disjuncts problems are observed to play a key role in producing poor classification performance ...
Nurulnur Athirah Azhar   +3 more
semanticscholar   +1 more source

A Self-Adaptive Complex Root Tracing Algorithm for the Analysis of Propagation and Radiation Problem

IEEE Transactions on Antennas and Propagation, 2021
An improved complex root tracing algorithm for radiation and propagation issues is proposed. The approach is based on a self-adaptive discretization of Cauchy’s argument principle for a $\mathbb {C} \times \mathbb {R}$ space and requires a reduced number of function calls in comparison to other procedures presented in the literature.
Sebastian Dziedziewicz   +2 more
openaire   +2 more sources

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student’s Grouping Problem

open access: closed2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2022
Malak Chniter   +3 more
openalex   +2 more sources

Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems

International/Italian Conference on Algorithms and Complexity, 2017
The q-Coloring problem asks whether the vertices of a graph can be properly colored with q colors. Lokshtanov et al. [SODA 2011] showed that q-Coloring on graphs with a feedback vertex set of size k cannot be solved in time O ∗ ((q−e) k ) O∗((q−e)k ...
L. Jaffke, B. Jansen
semanticscholar   +1 more source

Analysis and solutions to the stable roommate problem: An examination of complexity, stability, and matching algorithms

2023
Roommate issues with strong preferences are defined here. An extension of the Stable Marriage Problem that does not include two partners is the Stable Roommates Problem, or SR. The complexity and approximability of the problem of computing an egalitarian stable matching in instances of d-SRI.
Humbal Zaidi   +2 more
openaire   +1 more source

Complex network analysis of differential evolution algorithm applied to flowshop with no-wait problem

2014 IEEE Symposium on Differential Evolution (SDE), 2014
This paper analyses the attributes of population dynamics of Differential Evolution algorithm using Complex Network Analysis tools. The population is visualised as an evolving complex network, which exhibits non-trivial features. Complex network attributes such as adjacency graph gives interconnectivity, centralities give the overview of convergence ...
Ivan Zelinka   +4 more
openaire   +2 more sources

The Stability and Computational Complexity Analysis of Tree-seed Algorithm for Frequency-Constrained 10-bar Truss Problem

open access: closed2024 5th International Conference on Communications, Information, Electronic and Energy Systems (CIEES)
Ahmet Cevahir Çınar, Kadriye Nur Erman
openalex   +2 more sources

Analysis of Optimization Algorithms via Sum-of-Squares

Journal of Optimization Theory and Applications, 2019
We introduce a new framework for unifying and systematizing the performance analysis of first-order black-box optimization algorithms for unconstrained convex minimization.
Sandra S. Y. Tan   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy