{"created":"2021-03-01T06:16:34.073928+00:00","id":33,"links":{},"metadata":{"_buckets":{"deposit":"5a5fb70e-c06e-4bc3-8e72-dad4e2ed6107"},"_deposit":{"id":"33","owners":[],"pid":{"revision_id":0,"type":"depid","value":"33"},"status":"published"},"_oai":{"id":"oai:repository.dl.itc.u-tokyo.ac.jp:00000033","sets":["12:13","9:10:14"]},"item_2_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2000-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicPageEnd":"1331","bibliographicPageStart":"1323","bibliographicVolumeNumber":"11","bibliographic_titles":[{"bibliographic_title":"IEEE transactions on neural networks"}]}]},"item_2_description_13":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_2_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This paper presents an algorithm which realizes fast search for the solutions of combinatorial optimization problems with parallel digital computers. With the standard weight matrices designed for combinatorial optimization, many iterations are required before convergence to a quasioptimal solution even when many digital processors can be used in parallel, By removing the components of the eingenvectors with eminent negative eigenvalues of the weight matrix, the proposed algorithm avoids oscillation and realizes energy reduction under synchronous discrete dynamics, which enables parallel digital computers to obtain quasi-optimal solutions with much less time than the conventional algorithm.","subitem_description_type":"Abstract"}]},"item_2_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"137","nameIdentifierScheme":"WEKO"}],"names":[{"name":"岡部, 洋一"}]},{"nameIdentifiers":[{"nameIdentifier":"138","nameIdentifierScheme":"WEKO"}],"names":[{"name":"掛谷, 英紀"}]}]},"item_2_publisher_20":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC"}]},"item_2_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE."}]},"item_2_source_id_10":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA10736045","subitem_source_identifier_type":"NCID"}]},"item_2_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"10459227","subitem_source_identifier_type":"ISSN"}]},"item_2_subject_15":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"548.96","subitem_subject_scheme":"NDC"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kakeya, Hideki"}],"nameIdentifiers":[{"nameIdentifier":"135","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Okabe, Yoichi"}],"nameIdentifiers":[{"nameIdentifier":"136","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-05-30"}],"displaytype":"detail","filename":"IEEE_N_N_2000.pdf","filesize":[{"value":"189.9 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"IEEE_N_N_2000.pdf","url":"https://repository.dl.itc.u-tokyo.ac.jp/record/33/files/IEEE_N_N_2000.pdf"},"version_id":"bd1ac16c-b985-49da-af43-b65bd2019205"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"combinatorial optimization","subitem_subject_scheme":"Other"},{"subitem_subject":"eigenspace","subitem_subject_scheme":"Other"},{"subitem_subject":"eigenvalue","subitem_subject_scheme":"Other"},{"subitem_subject":"eigenvector","subitem_subject_scheme":"Other"},{"subitem_subject":"geometry","subitem_subject_scheme":"Other"},{"subitem_subject":"Hopfield network","subitem_subject_scheme":"Other"},{"subitem_subject":"partition problem","subitem_subject_scheme":"Other"},{"subitem_subject":"traveling salesman problem (TSP)","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Fast combinatorial optimization with parallel digital computers","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Fast combinatorial optimization with parallel digital computers"}]},"item_type_id":"2","owner":"1","path":["13","14"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-02-13"},"publish_date":"2006-02-13","publish_status":"0","recid":"33","relation_version_is_last":true,"title":["Fast combinatorial optimization with parallel digital computers"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-19T03:40:56.483079+00:00"}