Algorithm of the computational procedure
A computational procedure for prebending of wind turbine blades
... 5. CONCLUSIONS In this article, we proposed a method for wind turbine blade prebending. The method relies on stand-alone CFD and CSM computations, which makes it attractive from the standpoint of practical ...
14
Optimization Procedure by Using Genetic Algorithm
... Optimization procedure has been developed in this work which is based on genetic algorithm and is implemented successfully for solving the scheduling optimization problem of ...less computational ...
7
Statistical and Computational Guarantees for the Baum-Welch Algorithm
... The bound (28b) shows that the distance between θ b t and θ ∗ is bounded by two terms: the first decays geometrically as t increases, and the second term corresponds to a residual error term that remains independent of ...
53
A GA(TS) hybrid algorithm for scheduling in computational grids
... hybrid algorithm runs the GA as the main algorithm and calls TS procedure to improve individuals of the ...hybrid algorithm using different Grid scenarios generated by a Grid ...The ...
8
Computational Optimization and Analysis of Functional Bioinformatics using Parallel Algorithm
... Last step is to rearrange the PBD data to create PDB file. Each PDB file specifies the x, y and z coordinate of each atom of PDB elements. As we are gathering the PDB data from different PDB file it is necessary to ...
6
Deterministic mutation algorithm as a winner over forward selection procedure
... A well-known regression method, commonly known as FSP has been compared to a method that originated from EC for model structure selection. FSP has rather heavy statistical computation. On the other hand, the EC method, ...
6
An Algorithm for Multidimensional Optimization and Robustness Evaluation within a Rescheduling Procedure
... Whenever there is a deviation, several approaches can be applied, such as right-shifting, partial rescheduling and full rescheduling [14]. Right-shifting activities imply that no rescheduling process is performed and all ...
6
Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm
... Initialize-Subset procedure initializes the initial subset of V(G) as array S[j] = ...initialize-Subset procedure which considers the empty subgraph as the first derived ...
6
On a Dual Direct Cosine Simplex Type Algorithm and Its Computational Behavior
... entire procedure is repeated until all coefficients in Row 0 are non-positive in Iteration 3 and x 3 = 0 , x 4 = 2/5, x 5 = 9/5 and x 6 = 1 are optimal with z = 17/5 in original the ...
12
Qualitative Reasoning about Relative Directions : Computational Complexity and Practical Algorithm
... decision procedure for qualitative reasoning about relative directions has meanwhile turned to the question about whether an efficient decision procedure exists at ...a computational complexity point ...
112
The Computational Complexity of Tomita’s Algorithm
... parsing algorithm adapts K nuth’s (1967) well-known parsing algo rithm for LR()t) grammars to non-LR grammars, including ambiguous gram ...nuth’s algorithm is provably efficient: it requires at most 0 (n |G ...
6
Algorithm and computational complexity of Insulin
... The first aminoacid in this example has 10 atoms, the second one 22, the third one 19, etc. They have exactly these numbers of atoms because there are many codes in the insulin molecule, analog codes, and other voded ...
26
A novel load balancing algorithm for computational grid
... the computational nodes are heterogeneous but also the underlying networks connecting them are ...An algorithm, Load Balancing on Arrival (LBA) is proposed for small-scale (intraGrid) ...This ...
7
Computational Limits of A Distributed Algorithm for Smoothing Spline
... versus computational trade-off to address a basic ques- tion in the application of a distributed algorithm: what is the minimal computational cost in obtaining statistical optimality? In smoothing ...
37
Hybrid Metaheuristic Algorithm for Job Scheduling on Computational Grids
... an algorithm for solving the grid task scheduling problem through a combination of a GA, which is a global search algorithm, and the GELS algorithm, which searches ...The algorithm aims at ...
8
Computational Analysis of Routing Algorithm for Wireless Sensor Network
... The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential ...
15
An Efficient DCT Computational Algorithm Suitable for VLSI Implementation
... regular computational structure, which reduces implementation ...radix-2 algorithm is the most popular because of its computational efficiency and structural ...proposed algorithm, signal ...
10
An Efficient DCT Computational Algorithm Suitable For VLSI Implementation
... radix algorithm allows generating higher-order DCTs from lower-order ...regular computational structure, which reduces implementation ...CORDIC algorithm and radix2 algorithm to reduce the ...
10
A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid
... 5. Selection Policy – defines the tasks that should be migrated from overloaded resource to the idlest resources. Load balancing algorithms can be classified into two categories such as static algorithms and dynamic ...
16
A Fast Computational Genetic Algorithm for Economic Load Dispatch
... This will largely reduce the search space from wide Lamdba_max, Lambda_min to small region. The remaining steps are just same as for simple GA. Since the search space is now a very narrow region between the maximum and ...
8