{"created":"2025-01-18T23:31:04.872947+00:00","updated":"2025-01-21T22:08:48.985536+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00072905","sets":["1164:2592:6240:6332"]},"path":["6332"],"owner":"10","recid":"72905","title":["タブローの最適配置問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-28"},"_buckets":{"deposit":"44002ed9-f189-4979-bd28-86a192a43629"},"_deposit":{"id":"72905","pid":{"type":"depid","value":"72905","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"タブローの最適配置問題","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"タブローの最適配置問題"},{"subitem_title":"Optimal Tableaux Placement Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2011-02-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東北大学"},{"subitem_text_value":"東北大学"},{"subitem_text_value":"ブリュッセル自由大学"},{"subitem_text_value":"東北大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Universite Libre de Bruxelles","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/72905/files/IPSJ-AL11134002.pdf"},"date":[{"dateType":"Available","dateValue":"2013-02-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL11134002.pdf","filesize":[{"value":"268.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"adfd3225-d121-4b15-b6d6-258e18d9b678","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"安齋, 進也"},{"creatorName":"全眞嬉"},{"creatorName":"コルマン, マティアス"},{"creatorName":"徳山, 豪"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shinya, Anzai","creatorNameLang":"en"},{"creatorName":"Jinhee, Chun","creatorNameLang":"en"},{"creatorName":"Matias, Korman","creatorNameLang":"en"},{"creatorName":"Takeshi, Tokuyama","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"それぞれのピクセルが実数値の重みを持つ n×n のピクセル平面において，重ならないような k 個の長方形やタブローを配置する問題を考える．本論文では，それぞれの長方形やタブローの隅の位置が与えられる場合に動作する効率的なアルゴリズムについて議論する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We consider the optimization problem of finding k nonintersecting rectangles and tableaux in n × n pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-02-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2011-AL-134"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":72905,"links":{}}