the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...

Antenna plays a very important role in wireless communication. Array elements laid out nonuniformly could achieve better frequency reliability and lower sidelobe level than uniform spaced elements. Designing desirable nonuniform antenna array requires the tuning of distances between each element, excitation, amplitude, and so on. Such design problem can be solved by genetic algorithm. Based on ...

in practice, obtaining the global optimum for the economic dispatch {bf (ed)}problem with ramp rate limits and prohibited operating zones is presents difficulties. this paper presents a new andefficient method for solving the economic dispatch problem with non-smooth cost functions using afuzzy adaptive genetic algorithm (faga). the proposed algorithm  deals  with the issue ofcontrolling the ex...

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...

Genetic algorithms are one example of the use of a random element within an algorithm for combi-natorial optimization. We consider the application of the genetic algorithm to a particular problem, the Assembly Line Balancing Problem. A general description of genetic algorithms is given, and their specialized use on our test-bed problems is discussed. We carry out extensive computational testing...

In this presented paper, to accomplish semiconductor device synthesis for TCAD application, the Parallel Genetic Algorithm is applied as the core searching algorithm for “acceptability region” of device designables, which satisfy the designed device performance. The results of some experiments on FIBMOS are shown, which indicate the Parallel Genetic Algorithm is an efficient and fast searching ...

The timetabling problem is well known to be NP complete combinatorial problem. The problem becomes even more complex when addressed to individual timetables of students. The core of dealing with the problem in this application is a timetable builder based on mixed direct-indirect encoding evolved by a genetic algorithm with a self-adaptation paradigm, where the parameters of the genetic algorit...