All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

MINISATION OF COMPLEXLOGICAL FUNCTIONS

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F63468352%3A_____%2F12%3A%230000274" target="_blank" >RIV/63468352:_____/12:#0000274 - isvavai.cz</a>

  • Result on the web

    <a href="http://czechuniversity.com/dokumenty/konference/2012/ICSC.pdf" target="_blank" >http://czechuniversity.com/dokumenty/konference/2012/ICSC.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    MINISATION OF COMPLEXLOGICAL FUNCTIONS

  • Original language description

    : Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-knownQuine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    N - Vyzkumna aktivita podporovana z neverejnych zdroju

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    TENTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING APPLIED IN COMPUTER AND ECONOMIC ENVIRONMENTS

  • ISBN

    978-80-7314-279-7

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    109-116

  • Publisher name

    Evropský polytechnický institut, s.r.o.

  • Place of publication

    Kunovice

  • Event location

    Kunovice

  • Event date

    Jan 20, 2012

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article