{"id":128774,"updated":"2025-01-21T00:48:27.499639+00:00","links":{},"created":"2025-01-19T00:08:05.133298+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00128774","sets":["6504:8089:8096"]},"path":["8096"],"owner":"1","recid":"128774","title":["最適化問題への応用のための並列制約論理型言語の拡張"],"pubdate":{"attribute_name":"公開日","attribute_value":"1995-09-20"},"_buckets":{"deposit":"9525a522-0ed4-42d0-be0f-e5a3893b666b"},"_deposit":{"id":"128774","pid":{"type":"depid","value":"128774","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"最適化問題への応用のための並列制約論理型言語の拡張","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最適化問題への応用のための並列制約論理型言語の拡張"},{"subitem_title":"Extension to a Parallel Constraint Logic Programming Language for Applications in Optimization Problems.","subitem_title_language":"en"}]},"item_type_id":"22","publish_date":"1995-09-20","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":"東京大学理学部情報科学科:富士通(株) HPC本部 第二開発統括部"},{"subitem_text_value":"東京大学理学部情報科学科"},{"subitem_text_value":"東京大学工学部計数工学科"},{"subitem_text_value":"東京大学理学部情報科学科"}]},"item_22_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"IBM Japan Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Fujitsu Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Information Science, Univ. of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Mathematical Engineering, Univ. of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Dept. of Information Science, Univ. of Tokyo","subitem_text_language":"en"}]},"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/128774/files/KJ00001335062.pdf"},"date":[{"dateType":"Available","dateValue":"1995-09-20"}],"format":"application/pdf","filename":"KJ00001335062.pdf","filesize":[{"value":"237.0 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"1df51ea4-da1c-4523-883b-1d8262b709b2","displaytype":"detail","licensetype":"license_note"}]},"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":"並列制約論理型言語PARCSは大規模並列計算機上での実装に向いた宣言的な言語であり、優先度に基づく並列実行制御、整数有限領域上の制約解消と枝刈り、暗黙のOR並列実行などの特徴を持つ。PARCSの枝刈り機構はある探索枝から将来分岐する枝の数を劇的に減らすことができる一方で、ある探索枝での結果が他の枝の探索の実行に大きな影響を及ぼす並列のα-β剪定や分枝限定法などのアルゴリズムにおける枝刈りはこれまで記述できなかった。本研究ではこのような最適化のためのアルゴリズムを記述するために優先度の制御と枝刈りの新しい枠組を提案する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"78","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}],"bibliographicPageStart":"77","bibliographicIssueDates":{"bibliographicIssueDate":"1995-09-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"ソフトウェア","bibliographicVolumeNumber":"第51回"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}