{"product_id":"ieej-zt013033","title":"Interactive Scheduling System for Constraint Satisfaction Problem","description":"\u003cp\u003e\u003cstrong\u003eカテゴリ: \u003c\/strong\u003e全国大会\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e論文No: \u003c\/strong\u003e3-033\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eグループ名: \u003c\/strong\u003e【全国大会】平成13年電気学会全国大会論文集\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e発行日: \u003c\/strong\u003e2001\/03\/21\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eタイトル(英語): \u003c\/strong\u003eInteractive Scheduling System for Constraint Satisfaction Problem\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e著者名: \u003c\/strong\u003eJinsoo Kim(Paichai University,Korea),Keun Ho Ryu (Chungbuk National University,Korea)\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e著者名(英語): \u003c\/strong\u003eJinsoo Kim(Paichai University,Korea),Keun Ho Ryu (Chungbuk National University,Korea)\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e要約(日本語): \u003c\/strong\u003eFinding a solution to a constraint satisfaction problem requires choosing values for variables so as to satisfy the constraints of the problem. Conventional constraint-based scheduling systems are not enough to satisfy the all constraints because there a\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003e原稿種別: \u003c\/strong\u003e日本語\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003ePDFファイルサイズ: \u003c\/strong\u003e538 Kバイト\u003c\/p\u003e","brand":"IEEJ-PDF","offers":[{"title":"PDFダウンロード（一般価格440円\/会員価格220円） \/ A4 \/ 2","offer_id":46395731640559,"sku":"IEEJ-ZT013033-PDF","price":440.0,"currency_code":"JPY","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0718\/9512\/2159\/files\/IEEJ-PDF_062d7c1a-86ef-4b84-9cdc-ba01aa03e0e8.png?v=1744787479","url":"https:\/\/ieej.bookpark.ne.jp\/products\/ieej-zt013033","provider":"電気学会 電子図書館","version":"1.0","type":"link"}