By Topic

Solving the serializability problem by a connectionist machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Sungur ; Dept. of Electr. & Electron. Eng., Middle East Tech. Univ., Ankara, Turkey ; U. Halici

The serializability problem, which is NP-complete, is to decide on the existence of a total order consistent with a given ordering constraint. A connectionist machine is proposed for finding an almost sure solution to the serializability problem such that a feasible final configuration implies that the set is serializable with the given ordering constraint. An infeasible final configuration does not mean that it is not serializable. Therefore, the machine is not able to recognize all the serializable constraints. The experiments show that the machine seems to converge to a stable configuration in polynomial time and the performance of the machine is quite high, i.e., for most of the time, it is able to find the correct answer

Published in:

Neural Networks, 1993., IEEE International Conference on

Date of Conference: