Search Results - parallel using minimum algorithm*
Search alternatives:
- minimum algorithm »
-
1
Development of a heuristic procedure for balancing mixed-model parallel assembly line type II
Published 2010“…To solve these problems, two heuristic algorithms were developed and coded in MATLAB®. The first one allocates each model to only one parallel assembly line and achieves the initial arrangement of tasks with the minimum number of workstations for each line. …”
Get full text
Get full text
Thesis -
2
Distributed generation system using parallel inverters supplied by unstable DC source
Published 2009“…A full distributed generation system has been implemented and tested, the testing of the system proves that the system operates with minimum circulating current on the parallel connected inverter and minimum harmonic distortion on the inverter output voltage and current. …”
Get full text
Get full text
Article -
3
Harmonic reduction in three-phase parallel connected inverter
Published 2009“…Series resistors added to the inverter output to maintain same current in each inverter of the two parallel inverters, and to reduce the circulating current in the parallel inverters to the minimum. …”
Get full text
Get full text
Get full text
Article -
4
Distributed generation with parallel connected inverter
Published 2009“…Third harmonic injection PWM (THIPWM) reduces the total harmonic distortion and to make maximum use of the voltage source. DSP was used to generate the THIPWM and the control algorithm for the converter. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Parallel connected inverter for fuel cell system
Published 2008“…Third harmonic injection PWM (THIPWM) reduces the total harmonic distortion and to make maximum use of the voltage source. DSP was used to create the THIPWM and the control algorithm for the converter. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
Parallel batch self-organizing map on graphics processing unit using CUDA
Published 2018“…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
Get full text
Get full text
Article -
7
Parallel batch self-organizing map on graphics processing unit using CUDA
Published 2018“…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
Get full text
Get full text
Article -
8
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
Published 2005“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text
Thesis -
9
Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad
Published 2017“…The second algorithm is a variation in first algorithm in which data parallelism is introduced in each partition. …”
Get full text
Get full text
Get full text
Thesis -
10
WCDMA teletraffic performance improvement via power resource optimization using distributed parallel genetic algorithm
Published 2023“…The algorithm works by finding the minimum transmitter power with the help of Distributed Parallel Genetic Algorithm (DPGA) employed on an offload microcontroller system to form optimal beam coverage to reduce power usage of adaptive antenna at WCDMA base station. …”
Conference paper -
11
-
12
Pembinaan dan pelaksanaan algoritma selari bagi kaedah kelas TTHS dan TTKS dalam menyelesaikan persamaan parabolik pada sistem komputer selari ingatan teragih
Published 2004“…A comparison of the parallel performance measurements of the two classes of methods also indicate that the communication cost when AGE is used is minimum compared to new IADE (IADEN) and IADE with SUB strategy. …”
Get full text
Get full text
Thesis -
13
A GPU accelerated parallel genetic algorithm for the traveling salesman problem
Published 2024“…The problem was classified as NP-Hard. Several different algorithms were developed to solve the problem; among them, the Genetic Algorithm was used to deal with it. …”
Get full text
Get full text
Get full text
Article -
14
Distributed parallel deep learning with a hybrid backpropagation-particle swarm optimization for community detection in large complex networks
Published 2022“…Next, the method is integrated with two optimization algorithms: (1) backpropagation (BP), which optimizes deep learning locally within each local chunk of the CN; (2) particle swarm optimization (PSO), which is used to improve the BP optimization involving all CN chunks. …”
Get full text
Get full text
Get full text
Get full text
Article -
15
Deterministic Automatic Test Pattern Generation for Built-In Self Test System
Published 2006“…To illustrate that, the DATPG algorithm for digital combinational circuit using VHDL language is designed to generate the test patterns. …”
Get full text
Get full text
Thesis -
16
Probabilistic ensemble fuzzy ARTMAP optimization using hierarchical parallel genetic algorithms
Published 2015“…This was achieved by mitigating convergence in the genetic algorithms by employing a hierarchical parallel architecture. …”
Get full text
Get full text
Get full text
Article -
17
Voting algorithms for large scale fault-tolerant systems
Published 2011“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text
Thesis -
18
Dynamic communication performance of the TESH network under nonuniform traffic patterns
Published 2009“…We present a proof that the routing algorithm for the TESH network is deadlock free using $2$ virtual channels -- $2$ being the minimum number for dimension-order routing. …”
Get full text
Get full text
Get full text
Article -
19
Dynamic communication performance of a TESH network under the nonuniform traffic patterns
Published 2008“…In this paper, we present a deadlock-free routing algorithm for the TESH network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the network's dynamic communication performance under various nonuniform traffic patterns, using the proposed routing algorithm. …”
Get full text
Get full text
Get full text
Proceeding Paper -
20
Use of four-electrode arrays in three-dimensional electrical resistivity imaging survey
Published 2010“…A 3D resistivity imaging survey was carried out along fourteen parallel lines using dipole-dipole, Wenner-Schlumberger, and Wenner arrays with 2 m minimum electrode spacings. …”
Get full text
Article
