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

Yong Beom Cho, Takakazu Kurokawa, Yoshiyasu Takefuji, Hwa Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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 n2 processing elements requires computational bounds of a nearly O(1) time.

Original languageEnglish
Title of host publicationProceedings of the International Joint Conference on Neural Networks
Editors Anon
PublisherPubl by IEEE
Pages1503-1505
Number of pages3
Volume2
ISBN (Print)0780314212
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) - Nagoya, Jpn
Duration: 1993 Oct 251993 Oct 29

Other

OtherProceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3)
CityNagoya, Jpn
Period93/10/2593/10/29

Fingerprint

Parallel algorithms
Processing
Neural networks

ASJC Scopus subject areas

  • Software

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 (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.

Proceedings of the International Joint Conference on Neural Networks. ed. / Anon. Vol. 2 Publ by IEEE, 1993. p. 1503-1505.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cho, YB, 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. 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.
Cho YB, Kurokawa T, Takefuji Y, Kim H. O(1) approximate parallel algorithm for the n-task-n-person assignment problem. In Anon, editor, Proceedings of the International Joint Conference on Neural Networks. Vol. 2. Publ by IEEE. 1993. p. 1503-1505
Cho, Yong Beom ; Kurokawa, Takakazu ; Takefuji, Yoshiyasu ; Kim, Hwa. / O(1) approximate parallel algorithm for the n-task-n-person assignment problem. Proceedings of the International Joint Conference on Neural Networks. editor / Anon. Vol. 2 Publ by IEEE, 1993. pp. 1503-1505
@inproceedings{da57af043e9a4c0f9ae76ca202f8fd2a,
title = "O(1) approximate parallel algorithm for the n-task-n-person assignment problem",
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 n2 processing elements requires computational bounds of a nearly O(1) time.",
author = "Cho, {Yong Beom} and Takakazu Kurokawa and Yoshiyasu Takefuji and Hwa Kim",
year = "1993",
language = "English",
isbn = "0780314212",
volume = "2",
pages = "1503--1505",
editor = "Anon",
booktitle = "Proceedings of the International Joint Conference on Neural Networks",
publisher = "Publ by IEEE",

}

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 -