About: A Developmental Method for Construction of Arbitrarily Large Sorting Networks and Adders     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The paper deals with a non-traditional design method inspired by natural <br> ontogenesis (an embryonic approach) for construction of combinational logic <br> circuits (in particular sorting networks and adders). The general principle of the technique isbased on a set of proper<br> instructions known beforehand that are repeatedly applied on the embryo <br> (a trivial instance of a problem) to construct more complex system. Genetic algorithm is used to find a suitable <br> sequence of instructions -- a a prescription for the growth of the embryo. The system complexity can increase continually and infinitely. It is shown that <br> by employing of this approach the genetic algorithm is able to (1) rediscover the <br> principle of already known method and(2) find a novel algorithm, by means of <br> which we can obtain better solutions in comparison with a conventional method.
  • The paper deals with a non-traditional design method inspired by natural <br> ontogenesis (an embryonic approach) for construction of combinational logic <br> circuits (in particular sorting networks and adders). The general principle of the technique isbased on a set of proper<br> instructions known beforehand that are repeatedly applied on the embryo <br> (a trivial instance of a problem) to construct more complex system. Genetic algorithm is used to find a suitable <br> sequence of instructions -- a a prescription for the growth of the embryo. The system complexity can increase continually and infinitely. It is shown that <br> by employing of this approach the genetic algorithm is able to (1) rediscover the <br> principle of already known method and(2) find a novel algorithm, by means of <br> which we can obtain better solutions in comparison with a conventional method. (en)
  • Článek se zabývá netradiční metodou inspirovanou přírodní ontogenezí (vývoj embryonálního základu) pro konstrucki kombinačních logických obvodů (konkrétně řadicích sítí a sčítaček). Princip metody je založen na množině předem zvolených instrucí, jejichž opakovanou aplikací na embryo (triviální instanci problému) lze získat složitější řešení. Pro nalezení vhodné posloupnosti instrukcí (konstrukčního programu, podle kterého &quot;roste&quot; embryonální obvod) je použit genetický algoritmus. Složitost obvvodu se neustále zvyšuje po každé aplikaci konstrukčního programu. Je ukázáno, že s využitím této techniky je evoluční algoritmus schopen (1) znovuobjevit princip již známé metody a (2) nalézt inovativní řešení v porovnání s konvenční technikou.<br> (cs)
Title
  • Vývojová metoda pro konstruckci libovolně velkých řadicích sítí a sčítaček (cs)
  • A Developmental Method for Construction of Arbitrarily Large Sorting Networks and Adders
  • A Developmental Method for Construction of Arbitrarily Large Sorting Networks and Adders (en)
skos:prefLabel
  • Vývojová metoda pro konstruckci libovolně velkých řadicích sítí a sčítaček (cs)
  • A Developmental Method for Construction of Arbitrarily Large Sorting Networks and Adders
  • A Developmental Method for Construction of Arbitrarily Large Sorting Networks and Adders (en)
skos:notation
  • RIV/00216305:26230/05:PU55715!RIV06-GA0-26230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/04/0737)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 510831
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/05:PU55715
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Genetic algorithm, development, digital circuits design, sorting network, binary adder (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...i/riv/kodPristupu
http://linked.open...ontrolniKodProRIV
  • [4110D4B38847]
http://linked.open...i/riv/mistoVydani
  • Brno
http://linked.open...telVyzkumneZpravy
  • Faculty of Information Technology BUT
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bidlo, Michal
http://linked.open...rzeVyzkumneZpravy
  • NEUVEDEN
http://localhost/t...ganizacniJednotka
  • 26230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software