### Abstract

A parallel algorithm for the n-task-n-person assignment problem is presented in this paper. The proposed algorithm is based on the artificial neural network model where a large number of simple processing elements are used. Through a large number of simulation runs, it was empirically shown that the state of the system can converge to the solution within a hundred iteration steps regardless of the problem size n. The proposed algorithm using n^{2} processing elements requires computational bounds of a nearly O(1) time.

Original language | English |
---|---|

Title of host publication | Proceedings of the International Joint Conference on Neural Networks |

Editors | Anon |

Publisher | Publ by IEEE |

Pages | 1503-1505 |

Number of pages | 3 |

Volume | 2 |

ISBN (Print) | 0780314212 |

Publication status | Published - 1993 |

Externally published | Yes |

Event | Proceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) - Nagoya, Jpn Duration: 1993 Oct 25 → 1993 Oct 29 |

### Other

Other | Proceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) |
---|---|

City | Nagoya, Jpn |

Period | 93/10/25 → 93/10/29 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Proceedings of the International Joint Conference on Neural Networks*(Vol. 2, pp. 1503-1505). Publ by IEEE.

**O(1) approximate parallel algorithm for the n-task-n-person assignment problem.** / Cho, Yong Beom; Kurokawa, Takakazu; Takefuji, Yoshiyasu; Kim, Hwa.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the International Joint Conference on Neural Networks.*vol. 2, Publ by IEEE, pp. 1503-1505, Proceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3), Nagoya, Jpn, 93/10/25.

}

TY - GEN

T1 - O(1) approximate parallel algorithm for the n-task-n-person assignment problem

AU - Cho, Yong Beom

AU - Kurokawa, Takakazu

AU - Takefuji, Yoshiyasu

AU - Kim, Hwa

PY - 1993

Y1 - 1993

N2 - A parallel algorithm for the n-task-n-person assignment problem is presented in this paper. The proposed algorithm is based on the artificial neural network model where a large number of simple processing elements are used. Through a large number of simulation runs, it was empirically shown that the state of the system can converge to the solution within a hundred iteration steps regardless of the problem size n. The proposed algorithm using n2 processing elements requires computational bounds of a nearly O(1) time.

AB - A parallel algorithm for the n-task-n-person assignment problem is presented in this paper. The proposed algorithm is based on the artificial neural network model where a large number of simple processing elements are used. Through a large number of simulation runs, it was empirically shown that the state of the system can converge to the solution within a hundred iteration steps regardless of the problem size n. The proposed algorithm using n2 processing elements requires computational bounds of a nearly O(1) time.

UR - http://www.scopus.com/inward/record.url?scp=0027867616&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027867616&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0780314212

VL - 2

SP - 1503

EP - 1505

BT - Proceedings of the International Joint Conference on Neural Networks

A2 - Anon, null

PB - Publ by IEEE

ER -