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”

Filters

224 615 (0,259s)

Result

Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method

the Petrick extension of the Quine-McCluskey method does not give a generally usable focus on interpretation of the result of the Quine-McCluskey method and show-McCluskey method

BC - Teorie a systémy řízení

  • 2007
  • Jx
Result

MINISATION OF COMPLEXLOGICAL FUNCTIONS

an optimal solution. Since the Petrick extension of the Quine-McCluskey method does the well-knownQuine-McCluskey method, which gives a unique procedure of computing-McCluskey method and...

IN - Informatika

  • 2012
  • D
  • Link
Result

Minimisation of Complex Logical Functions Using Soft Computing Techniques

focus on interpretation of the result of the Quine-McCluskey method and show of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation....

JC - Počítačový hardware a software

  • 2008
  • D
Result

Quine-McCluskey method for many-valued logical functions

In this paper we deal with a generalization of the Quine McCluskey method. We show that the generalized method can find a normal form for any finite-valued logical function. Moreover, this normal form is simpler th...

JD - Využití počítačů, robotika a její aplikace

  • 2007
  • Jx
Result

Logical Circuit Design in Many-Valued Logic

We present a method of finding optimized normal forms of functions in many-valued logic. Our approach is based on an extension of the set od logical connectives, a generalization of the technique of Svoboda maps and a generalization of the <...

JD - Využití počítačů, robotika a její aplikace

  • 2003
  • D
Result

Propositional Analyzer

Propositional Analyzer can decide whether a formula of the proposional calculus is a tautological consequence of a set of formulae, used as the assumptions. It also calculates the disjunctive and conjunctive normal forms of the given formula and then...

BA - Obecná matematika

  • 2012
  • R
  • Link
Result

The Improvement of Quine-McCluskey Method Using Set Covering Problem for Safety Systems

the Quine-McCluskey method, which is based on their systematic use. However, because this method does not provide a minimal form of logical function, and as a result-processing method, the genetic algorit...

Communication engineering and systems

  • 2019
  • D
  • Link
Result

Compression of small text files

scheme improve the compression ratio over other existing methods.

IN - Informatika

  • 2008
  • Jx
Result

The Optimisation of Large Scale Logical Circuits

, in those cases, we could apply Boolean algebra laws directly or use the Quine-McCluskey method, which is based on their systematic use. Unfortunately, this method does, it is necessary to use heuristic method...

Computer hardware and architecture

  • 2019
  • D
  • Link
Result

Quine and Semantics

An arguments against Quines semantic behaviorism. It is showed that Quines behavioral semantics is theoretically unfruitful.

AA - Filosofie a náboženství

  • 1997
  • Jx
  • 1 - 10 out of 224 615