-
81
Optimization of a reinforced concrete structure subjected to dynamic wind action
Published 2022-01-01Subjects: Get full text
Article -
82
Optimization of a reinforced concrete structure subjected to dynamic wind action
Published 2021-12-01Subjects: Get full text
Article -
83
Analysis of stochastic models of identification clouds
Published 2005-12-01Subjects: Get full text
Article -
84
Application of compressive sensing techniques for advanced image processing and digital image transmission
Published 2024-01-01Subjects: Get full text
Article -
85
Algorithmic diagnosis of symptoms and signs : cost effective approach /
Published 1995Subjects: View in OPAC
Book -
86
Algorithmic diagnosis of symptoms and signs : cost effective approach /
Published 1995Subjects: View in OPAC
Book -
87
Structured Dynamics in the Algorithmic Agent
Published 2025-01-01Subjects: “…algorithmic information theory (AIT)…”
Get full text
Article -
88
Robust adaptive beamforming algorithm
Published 2009-01-01“…The performance of least mean squares(LMS) algorithm degraded dramatically in the presence of even slight steering vector mismatches.In order to overcome the shortage,a novel robust adaptive beamforming algorithm based on the variable diagonal loading technique was proposed.The signal steering vector was obtained via the gradient-descent method and the diagonal loading term was incorporated at each recursive step.Then,the optimal weight vector was de-rived.To account for the contradiction of convergence rate and steady errors,a function between the step size and input signals was built to obtain the variable step size.The proposed algorithm had a low complexity cost without the inverse matrix and eigendecomposition.The proposed algorithm offered faster convergence rate,provided a sufficient robustness against the mismatches and made the mean output array SINR consistently close to the optimal one.The theoretical analysis and simulation results demonstrate that the performance of the proposed algorithm can outperform that of the conventional algorithm.…”
Get full text
Article -
89
On a New Reliable Algorithm
Published 2009-01-01“…The HAM is treated as an algorithm for approximating the solution of the problem in a sequence of time intervals; that is, HAM is converted into a hybrid numeric-analytic method called the multistage HAM (MSHAM). …”
Get full text
Article -
90
SFP selection algorithm for SFC
Published 2017-05-01“…In order to achieve the new business deployment model by the convergence of cloud and network,SFC technology has been promoted greatly.As one of the key technologies in SFC,the SFP selection strategy affects the network performance and business experience directly.Aiming at the single target defect existing in business path se-lection strategy,the minimum weight algorithm based on the network delay and load was proposed and simulated.It could optimize the resources allocation and improve the network performance.A technical reference was provided for the operators to deploy the network and resources in the future.…”
Get full text
Article -
91
-
92
Investigation of outlier detection algorithm
Published 2005-12-01“…The results demonstrate the possibilities to improve the performance of computation and the stability of the outlier detection algorithm. …”
Get full text
Article -
93
Cloud Model Bat Algorithm
Published 2014-01-01“…Bat algorithm (BA) is a novel stochastic global optimization algorithm. …”
Get full text
Article -
94
Composite Differential Search Algorithm
Published 2014-01-01“…Differential search algorithm (DS) is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. …”
Get full text
Article -
95
Algorithmic Approach to the Split Problems
Published 2013-01-01“…This paper deals with design algorithms for the split variational inequality and equilibrium problems. …”
Get full text
Article -
96
Algorithmic aspects of bipartite graphs
Published 1995-01-01“…Tarjan [2], who developed efficient algorithms for use on directed graphs. This paper considers an edge elimination process on bipartite graphs, presenting several theorems which lead to an algorithm for computing the minimal fill-in of a given ordered graph.…”
Get full text
Article -
97
-
98
The temolate for parallel branch algorithm
Published 2004-12-01Subjects: “…branch and bound algorithms…”
Get full text
Article -
99
Defence and criticism of algorithmic governance
Published 2024-12-01Subjects: Get full text
Article -
100
Optimization of Electrical Discharge Machining Process by Metaheuristic Algorithms
Published 2024-03-01“…This paper emphasizes optimizing the EDM process using three metaheuristic algorithms: Glowworm Swarm Optimization (GSO), Grey Wolf Optimizer (GWO), and Whale Optimization Algorithm (WOA). …”
Get full text
Article