Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/3783
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kalganova, T | - |
dc.contributor.author | Strechen, N | - |
dc.date.accessioned | 2009-10-27T15:03:05Z | - |
dc.date.available | 2009-10-27T15:03:05Z | - |
dc.date.issued | 1997 | - |
dc.identifier.citation | Proceedings of the 3rd Nordic Workshop on GA. Helsinki, Finland, 18-22 August 1997. pp. 245-254. | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/3783 | - |
dc.description | Conference Paper | en |
dc.description.abstract | This paper presents a variable partition algorithm which combines the quasi-reduced ordered multiple-terminal multiple-valued decision diagrams and genetic algorithms (GAs). The algorithm is better than the previous techniques which find a good functional decomposition by non-exhaustive search and expands the range of searching for the best decomposition providing the optimal subtable multiplicity. The possible solutions are evaluated using the gain of decomposition for a multiple-output multiple-valued logic function. The distinct feature of GA is the possible solutions being coded by real numbers. Here the simplex-based crossover is proposed to use for the recombination stage of GA. It permits to increase the GA coverage | en |
dc.language.iso | en | en |
dc.publisher | 3NWGA committees | en |
dc.subject | disjoint decomposition | en |
dc.subject | multiple-valued decision diagrams | en |
dc.subject | genetic algorithm | en |
dc.subject | simplex-like crossover | en |
dc.title | Genetic algorithm approach to find the best input variable partitioning | en |
dc.type | Article | en |
Appears in Collections: | Dept of Electronic and Electrical Engineering Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1997_kalganova_3nwga97.pdf | 780.5 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.