[PDF] Top 20 Minimization of Boolean Functions Using Genetic Algorithm

Minimization of Boolean Functions Using Genetic Algorithm

... new genetic algorithm based method for presenting the minimal show of a Boolean ...of Boolean function are the basic ...the genetic algorithm to do ... See full document

5

EXTRUSION DIE LOAD MINIMIZATION USING GENETIC ALGORITHM AND SIMULATED ANNEALING ALGORITHM

... the minimization of extrusion pressure by varying die cone angle and extrusion ...by using genetic algorithm at the 16 th ...by using simulated annealing algorithm at the 46 th ... See full document

7

Minimization of the Wilson’s Central Terminal voltage potential via a genetic algorithm

... WCT. Minimization was attempted varying in real time the weight resistors connected to the ...software minimization (genetic algorithm) method using data recorded from 72 ... See full document

5

Enhancement of voltage profile and loss minimization in distribution system using genetic algorithm

... for minimization of real power losses and load balancing among the distribution feeders to save energy and enhance the overall performance of the distribution ...loss minimization, peak saving, over load ... See full document

8

Optimal Placement of Capacitor and DG for Minimization of Power Losses using Genetic Algorithm and Artificial Bee Colony Algorithm

... © 2016, IRJET | Impact Factor value: 4.45 | ISO 9001:2008 Certified Journal | Page 2484 another nourishment source in the area of the one in the memory relying upon visual data. Visual data depends on the examination of ... See full document

7

Error Minimization in Localization of Wireless Sensor Networks using Genetic Algorithm

... The first phase uses a traditional range free localization algorithm based on Mobile anchor to estimate the location of a sensor node roughly.. The second phase is a post optimization ph[r] ... See full document

5

Minimizing waste (off-cuts) using cutting stock model: The case of one dimensional cutting stock problem in wood working industry

... on genetic algorithm to solve one-dimensional cutting stock problem by considering two conflicting objective functions: minimization of both the number of objects and the number of different ... See full document

26

Initialization of a multi-objective evolutionary algorithms knowledge acquisition system for renewable energy power plants

... lengths minimization and the constraint of the center mechanism workspace in the ...two minimization objective functions ...search Genetic Algorithm ...emissions minimization, ... See full document

20

Abstract: This Paper presents the solution of Optimal Power Flow (OPF) with different objective functions i.e. fuel

... objective functions i.e. fuel cost minimization and active power loss minimization using heuristic technique namely Genetic Algorithm (GA) ...cost minimization as the ... See full document

8

Evolving boolean functions with conjunctions and disjunctions via genetic programming

... RLS-GP algorithm, which repeatedly chooses the best between its current solution and an offspring generated by applying the HVL-Prime mutation operator, which with equal probability inserts, deletes, or ... See full document

10

Bent and Semi-bent Functions via Linear Translators

... plateaued functions: bent and semi-bent ...semi-bent functions in the Maiorana-McFarland class using Boolean functions having linear structures (linear translators) ...results, ... See full document

18

A KIM compliant potfit for fitting sloppy interatomic potentials : application to the EDIP model for silicon

... local minimization is suf fi cient for EDIP ( at least in the vicinity of the original parameters ) , we explore the ef fi ciency of Powell ’ s method, the geodesic LM algorithm added to pot fi t, and the ... See full document

19

On the Primary Constructions of Vectorial Boolean Bent Functions

... bent functions are given, which imply answers to one open problem proposed by ...bent functions corresponding to the five known classes of bent exponents are ...bent functions, the main results are ... See full document

43

Blocks of Monotone Boolean Functions

... Dedekind's problem. D(0) – D(4) computed by R. Dedekind (1897). D(5) are given by Church (1940). D(6) was calculated by Ward (1946), D(7) was calculated by Church (1965) and D(8) by Wiedemann [2] (1991). As it turned ... See full document

7

The depth of all Boolean functions

... In the next two ssglions we describe the main result of tne paper, a scheme of depth n-t-I to cover Bn over basis Br... stage is to produce anrrapproximation[ to such a scheme in depth n[r] ... See full document

16

Minimization of Switching Functions using Quine McCluskey Method

... logical minimization, and then shows the Quine-McCluskey algorithm for simplifying switching ...an algorithm has been developed for automatic decoding ... See full document

5

The second-order nonlinearity of a class of Boolean functions

... cubic functions more refined bounds can be obtained by using the technique developed by Carlet and results related of dimensions of solutions spaces of linearized polynomials which was done by Gangopadhyay ... See full document

6

Computation Methods for the Diagnosis and Prognosis of Heart Disease

... done using pre- processing, in order to reduce the dimensionality without compromising the accuracy, by removing immaterial data present in the ...Firefly algorithm for the optimization of ... See full document

5

Positive Boolean Functions as Multiheaded Clauses

... 5 A Pos-Based Groundness Analyser To assess the representation, two Pos-based groundness analysers built on multiheaded lauses were implemented in Prolog: one goal-dependent and one goal[r] ... See full document

16

Abstracting Numeric Constraints with Boolean Functions

... This paper addresses these problems by presenting a simple, synta ti algorithm for abstra ting numeri onstraints that neither uses proje tion nor introdu es temporary variables.. The alg[r] ... See full document

11