Attributes | Values |
---|
rdf:type
| |
Description
| - An approach is presented in which the object under design can grow continually and infinitely. First, a small object (that we call the embryo) has to be prepared to solve the trivial instance of a problem. Then the evolved program (the constructor) is applied on the embryo to create a larger object (solving a larger instance of the problem). Then the same constructor is used to create a new instance of the object from the created larger object and so on. Every new instance of the object is able to perfoorm the function of all previous instances. As an example, constructors for growing sorting and median networks are evolved and analyzed.
- An approach is presented in which the object under design can grow continually and infinitely. First, a small object (that we call the embryo) has to be prepared to solve the trivial instance of a problem. Then the evolved program (the constructor) is applied on the embryo to create a larger object (solving a larger instance of the problem). Then the same constructor is used to create a new instance of the object from the created larger object and so on. Every new instance of the object is able to perfoorm the function of all previous instances. As an example, constructors for growing sorting and median networks are evolved and analyzed. (en)
- Je prezentována metoda, která umožňuje evoluční návrh libovolně velkých objektů. Nejdříve musí být připraveno řešení malé instance problému (kterou nazýváme embryo). Potom se použije evolucí navržený program tak, že z řešení menšího problému se vygeneruje řešení většího problému atd. rekurzivně. Jako příklad jsou uvedeny konstruktory (programy) pro návrh řadicích a mediánových sítí. (cs)
|
Title
| - Evoluce konstruktorů pro nekonečně rostoucí řadicí a mediánové sítě (cs)
- Evolving Constructors for Infinitely Growing Sorting Networks and Medians
- Evolving Constructors for Infinitely Growing Sorting Networks and Medians (en)
|
skos:prefLabel
| - Evoluce konstruktorů pro nekonečně rostoucí řadicí a mediánové sítě (cs)
- Evolving Constructors for Infinitely Growing Sorting Networks and Medians
- Evolving Constructors for Infinitely Growing Sorting Networks and Medians (en)
|
skos:notation
| - RIV/00216305:26230/04:PU49061!RIV/2005/GA0/262305/N
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GP102/03/P004), Z(MSM 262200012)
|
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
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/04:PU49061
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - evolutionary design, development, sorting network, median (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - SOFSEM: Theory and Practice of Computer Science
|
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
| |
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |