English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities