Life Science Encyclopedia

Target:
Operation:
Search for:

Overview Complete alphabetical index  
Parity benchmark

Parity problems are widely used as Benchmark problems widely 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:

  1. a very simple artificial neural network cannot solve it and
  2. all inputs need to be considered and a change to any one of them changes the answer.

References

  • Foundations of Genetic Programming


 
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Parity_benchmark". A list of authors is available in Wikipedia.
MyBionity.COM
Newsletter Subscription
Your e-mail:
Top  
© 2001-2008 Chemie.DE Information Service GmbH
a Life Science Network Division

 www.Chemie.DE   www.Bionity.COM   www.ChemEurope.COM   www.ChemieKarriere.NET   www.BioKarriere.NET