WA*, which has been widely used in computer science and AI applications is a search method based on A*. This method dose not guaranty to find optimal solutions, but with the appropriate determination of the weights, nearly optimal solutions can be efficiently found. Generally, the systems that use WA* as their search mechanism, use a constant weight for all problems in various domains, while different domains have different characteristics. In this paper, we show that using a constant weight for all domains and problems is inappropriate. We also introduce a novel search strategy named GBFS* as an upper bound of the WA* performance.
Ali Akramifar,S. and Ghassem-Sani,G. (2007). Evaluating the Constant Weight in WA. (e215996). The CSI Journal on Computer Science and Engineering, 5(1), e215996
MLA
Ali Akramifar,S. , and Ghassem-Sani,G. . "Evaluating the Constant Weight in WA" .e215996 , The CSI Journal on Computer Science and Engineering, 5, 1, 2007, e215996.
HARVARD
Ali Akramifar S., Ghassem-Sani G. (2007). 'Evaluating the Constant Weight in WA', The CSI Journal on Computer Science and Engineering, 5(1), e215996.
CHICAGO
S. Ali Akramifar and G. Ghassem-Sani, "Evaluating the Constant Weight in WA," The CSI Journal on Computer Science and Engineering, 5 1 (2007): e215996,
VANCOUVER
Ali Akramifar S., Ghassem-Sani G. Evaluating the Constant Weight in WA. CSIonJCSE, 2007; 5(1): e215996.
The CSI Journal on Computer Science and Engineering