Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Parity_benchmark> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Parity_benchmark abstract "Parity problems are widely used as benchmark problems in genetic programming but inherited from the artificial neural network community. Parity is calculated by summing all the binary inputs and reporting if the sum is odd or even. This is considered difficult because:a very simple artificial neural network cannot solve it, andall inputs need to be considered and a change to any one of them changes the answer.".
- Parity_benchmark wikiPageExternalLink FOGP.
- Parity_benchmark wikiPageID "1514696".
- Parity_benchmark wikiPageRevisionID "601676956".
- Parity_benchmark hasPhotoCollection Parity_benchmark.
- Parity_benchmark subject Category:Genetic_programming.
- Parity_benchmark comment "Parity problems are widely used as benchmark problems in genetic programming but inherited from the artificial neural network community. Parity is calculated by summing all the binary inputs and reporting if the sum is odd or even. This is considered difficult because:a very simple artificial neural network cannot solve it, andall inputs need to be considered and a change to any one of them changes the answer.".
- Parity_benchmark label "Parity benchmark".
- Parity_benchmark sameAs m.0575s8.
- Parity_benchmark sameAs Q7137530.
- Parity_benchmark sameAs Q7137530.
- Parity_benchmark wasDerivedFrom Parity_benchmark?oldid=601676956.
- Parity_benchmark isPrimaryTopicOf Parity_benchmark.