Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities

04/05/2015
by   Can Eren Sezener, et al.
0

In this paper we present several heuristic algorithms, including a Genetic Algorithm (GA), for obtaining polynomial threshold function (PTF) representations of Boolean functions (BFs) with small number of monomials. We compare these among each other and against the algorithm of Oztop via computational experiments. The results indicate that our heuristic algorithms find more parsimonious representations compared to the those of non-heuristic and GA-based algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2019

Variations of Genetic Algorithms

The goal of this project is to develop the Genetic Algorithms (GA) for s...
research
05/24/2010

Genetic algorithms and the art of Zen

In this paper we present a novel genetic algorithm (GA) solution to a si...
research
08/22/2019

Learning Fitness Functions for Genetic Algorithms

A genetic algorithm (GA) attempts to solve a problem using a pool of pot...
research
02/22/2021

A Fast Heuristic for Gateway Location in Wireless Backhaul of 5G Ultra-Dense Networks

In 5G Ultra-Dense Networks, a distributed wireless backhaul is an attrac...
research
06/02/2019

Multi-objective Pruning for CNNs using Genetic Algorithm

In this work, we propose a heuristic genetic algorithm (GA) for pruning ...
research
07/23/2019

Genetic Algorithms for Starshade Retargeting in Space-Based Telescopes

Future space-based telescopes will leverage starshades as components tha...

Please sign up or login with your details

Forgot password? Click here to reset