書誌事項
- タイトル別名
-
- Combining Systematic and Local Search for Approximately Solving Fuzzy Constraint Satisfaction Problems
- ケイトウテキ キョクショテキ タンサク ノ キョウチョウ ニ ヨル ファジィ セイヤク ジュウソク モンダイ ノ キンジカイホウ
この論文をさがす
説明
A fuzzy constraint satisfaction problem (FCSP) is an extension of the classical CSP, a powerful tool for modeling various problems based on constraints among variables. Basically, the algorithms for solving CSPs are classified into two categories: the systematic search (complete methods based on search trees) and the local search (approximate methods based on iterative improvement). Both have merits and demerits. Recently, much attention has been paid to hybrid methods for integrating both merits to solve CSPs efficiently, but no such attempt has been made so far for solving FCSPs. <br> In this paper, we present a hybrid, approximate method for solving FCSPs. The method, called the Spread-Repair-Shrink (SRS) algorithm, combines a systematic search with the Spread-Repair (SR) algorithm, a local search method recently developed by the authors. The SRS algorithm spreads (or expands) and shrinks a set of search trees in order to repair constraints locally until, finally, the satisfaction degree of the worst constraints (which are the roots of the trees) is improved. We empirically show that SRS outperforms the SR algorithm as well as the well-known methods such as Forward Checking and Fuzzy GENET, when the size of the problems is sufficiently large.
収録刊行物
-
- 人工知能学会論文誌
-
人工知能学会論文誌 21 20-27, 2006
一般社団法人 人工知能学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282680084202112
-
- NII論文ID
- 10022005834
-
- NII書誌ID
- AA11579226
-
- ISSN
- 13468030
- 13460714
-
- HANDLE
- 2115/14560
-
- NDL書誌ID
- 8686356
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- IRDB
- NDLサーチ
- Crossref
- CiNii Articles
- OpenAIRE
-
- 抄録ライセンスフラグ
- 使用不可