{"id":161577,"updated":"2025-01-20T11:54:13.348876+00:00","links":{},"created":"2025-01-19T00:34:18.809569+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00161577","sets":["6504:8672:8731"]},"path":["8731"],"owner":"6748","recid":"161577","title":["タスクスケジューリング問題におけるDF/IHS法のハッシュテーブルを用いた探索ノード数削減"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-03-10"},"_buckets":{"deposit":"2d0506d2-d6be-4972-abfa-6e305a02e1e7"},"_deposit":{"id":"161577","pid":{"type":"depid","value":"161577","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"タスクスケジューリング問題におけるDF/IHS法のハッシュテーブルを用いた探索ノード数削減","author_link":["314251","314254","314252","314253"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"タスクスケジューリング問題におけるDF/IHS法のハッシュテーブルを用いた探索ノード数削減"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"コンピュータシステム","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2016-03-10","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"千葉工大"},{"subitem_text_value":"千葉工大"},{"subitem_text_value":"千葉工大"},{"subitem_text_value":"千葉工大"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/161577/files/IPSJ-Z78-4H-06.pdf","label":"IPSJ-Z78-4H-06.pdf"},"date":[{"dateType":"Available","dateValue":"2016-05-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Z78-4H-06.pdf","filesize":[{"value":"366.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"21f52bcc-45ae-4608-9e05-2a7b1d947d9b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松瀬, 弘明"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"中村, あすか"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"富永, 浩文"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"前川, 仁孝"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究では，タスクスケジューリング問題におけるDF/IHS(Depth First/Implicit Heuristic Seach)法を高速化するために，ハッシュテーブルを用いて探索ノード数を削減する手法を提案する．タスクスケジューリング問題は，マルチプロセッサシステム環境でタスクをプロセッサに割り当てる際に実行時間が最小となるようなスケジュールを求める問題である．DF/IHS法で生成する探索木は，実行可能なスケジュールを列挙するため，探索済みノードと同じタスクを割り当てたスケジュール長の長い部分問題を生成する場合がある．このような部分問題は，探索する必要がない．このため，提案手法では探索済みの部分問題情報を格納したハッシュテーブルを用いて枝刈りする．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"198","bibliographic_titles":[{"bibliographic_title":"第78回全国大会講演論文集"}],"bibliographicPageStart":"197","bibliographicIssueDates":{"bibliographicIssueDate":"2016-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2016"}]},"relation_version_is_last":true,"weko_creator_id":"6748"}}