### 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 |

ISBN (Print) | 0780314212 |

Publication status | Published - 1993 Dec 1 |

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 |

### Publication series

Name | Proceedings of the International Joint Conference on Neural Networks |
---|---|

Volume | 2 |

### 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 |

### ASJC Scopus subject areas

- Software
- Artificial Intelligence

## Fingerprint Dive into the research topics of 'O(1) approximate parallel algorithm for the n-task-n-person assignment problem'. Together they form a unique fingerprint.

## Cite this

Cho, Y. B., Kurokawa, T., Takefuji, Y., & Kim, H. (1993). O(1) approximate parallel algorithm for the n-task-n-person assignment problem. In Anon (Ed.),

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