A Solution for the N-bit Parity Problem Using a Single Translated Multiplicative Neuron

Author： Iyoda Eduardo Masato Nobuhara Hajime Hirota Kaoru

ISSN： 1370-4621

Source： Neural Processing Letters, Vol.18, Iss.3, 2003-12, pp. : 233-238

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient Solution of A, x ^(k) = b ^(k) Using A ⁻¹

By Ditkowski Adi Fibich Gadi Gavish Nir

Journal of Scientific Computing, Vol. 32, Iss. 1, 2007-07 ,pp. : 29-44

Springer Publishing Company

Access to resources Recommend Favorite

New Results on the Queens_n² Graph Coloring Problem

By Vasquez Michel

Journal of Heuristics, Vol. 10, Iss. 4, 2004-07 ,pp. : 407-413

Springer Publishing Company

Access to resources Recommend Favorite

An O(n²) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

By Tian Zhongjun Ng C. Cheng T.

Journal of Scheduling, Vol. 9, Iss. 4, 2006-08 ,pp. : 343-364

Springer Publishing Company

Access to resources Recommend Favorite

Three-dimensional link dynamics simulator based on N-single-particle movement

By Toda Hideki Sankai Yoshiyuki

Advanced Robotics, Vol. 19, Iss. 9, 2005-10 ,pp. : 977-993

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Hybrid Heuristic for the p-Median Problem

By Resende Mauricio G.C. Werneck Renato F.

Journal of Heuristics, Vol. 10, Iss. 1, 2004-01 ,pp. : 59-88

Springer Publishing Company

Access to resources Recommend Favorite