Results 271 to 280 of about 148,724 (314)
Some of the next articles are maybe not open access.
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems
Journal of Scheduling, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bita Tadayon, J. Cole Smith
openaire +1 more source
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
Computers & Operations Research, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Larusic, Abraham P. Punnen
openaire +2 more sources
A Self-Adaptive Complex Root Tracing Algorithm for the Analysis of Propagation and Radiation Problem
IEEE Transactions on Antennas and Propagation, 2021An 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 +1 more source
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 ...
Donald Davendra +4 more
openaire +2 more sources
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 ...
Donald Davendra +4 more
openaire +2 more sources
The Dynamic Portfolio Selection Problem: Complexity, Algorithms and Empirical Analysis
2020In the real world, problems usually involve a characteristic that is not typically considered when experimenting algorithmically; this characteristic is the change concerning time. The parameters included in many issues are not static, but dynamic, they are altered over time.
Daniel A. Martínez-Vega +4 more
openaire +1 more source
Journal of Computational and Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Chen, Kai Kuang, Xueling Yan
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu Chen, Kai Kuang, Xueling Yan
openaire +1 more source
Students misconceptions in analysis of algorithmic and computational complexity of problems
Proceedings of the 18th ACM conference on Innovation and technology in computer science education, 2013Course "Computability and Complexity" allows students to get familiar with limits of computation and degrees of algorithmic (decidable, enumerable, undecidable) and computational (P, NP, NP-complete) complexity of problems. Students learn to use reducibility techniques for analysis of language complexity.
openaire +1 more source
Complex Network Analysis of Evolutionary Algorithms Applied to Combinatorial Optimisation Problem
2014This research analyses the development of a complex network in an evolutionary algorithm (EA). The main aim is to evaluate if a complex network is generated in an EA, and how the population can be evaluated when the objective is to optimise an NP-hard combinatorial optimisation problem.
Donald Davendra +3 more
openaire +2 more sources
2015 7th International Conference on Communication Systems and Networks (COMSNETS), 2015
We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MS) in a given time slot so as to limit the interference to neighboring cells; also, each base station (BS) uses a fixed ...
Ashwathi Nambiar, Gaurav S. Kasbekar
openaire +1 more source
We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse. In each cell, only a subset of the available subchannels are allocated to mobile stations (MS) in a given time slot so as to limit the interference to neighboring cells; also, each base station (BS) uses a fixed ...
Ashwathi Nambiar, Gaurav S. Kasbekar
openaire +1 more source
Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems
2012 Third International Conference on Networking and Computing, 2012The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because of space limitation. They will be given at presentation.
openaire +1 more source