Results 231 to 240 of about 871,423 (283)

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems

Applied Mathematics and Computation, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohamed Achache
openaire   +2 more sources

Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows

, 2017
Estimating the theoretical complexity of a parallel algorithm can give an impression on how it will perform in practice. However, this complexity analysis is very often omitted in the works from the parallel computation field. In this paper, we theoretically analyze the time complexity of our parallel algorithm for the pickup and delivery problem with ...
Miroslaw Blocho, Jakub Nalepa
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

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, Rafal Lech, Piotr Kowalczyk   +2 more
openaire   +1 more source

Complexity Analysis and Application of Gray Code-Based Genetic Algorithm for Container Loading Problem Optimization

2025 4th International Conference on Electronics Representation and Algorithm (ICERA)
Muh. Akbar, Ingrid Nurtanio, null Syafaruddin   +2 more
openaire   +2 more sources

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, Dr. Arun Garg, Dr. Ashfaqur Rehman   +2 more
openaire   +1 more source

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

2024 5th International Conference on Communications, Information, Electronic and Energy Systems (CIEES)
Ahmet Cevahir Cinar, Kadriye Nur Erman
openaire   +2 more sources

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, 2013
Course "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

Semianalytic Finite-Element Method in Continuum Creep Fracture Mechanics Problems for Complex-Shaped Spatial Bodies and Related Systems. Part 2. Analysis of Reliability of the Results and Efficiency of the Method, and Algorithms for Solving the Problems

Strength of Materials, 2002
We perform analyses of convergence and reliability of the results of solving continuum creep-fracture problems and efficiency of the semianalytic finite-element method for heterogeneous circular nonclosed bodies.
V. A. Bazhenov, A. I. Gulyar, E. E. Maiboroda, S. O. Piskunov   +3 more
openaire   +1 more source