Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities
Clicks: 73
ID: 283361
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Popular Article
21.3
/100
73 views
32 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #428 of 803 articles by views in arXiv
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 803 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
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.
| Reference Key |
oztop2015heuristic
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Can Eren Sezener; Erhan Oztop |
| Journal | arXiv |
| Year | 2015 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.