{"type":"ScholarlyArticle","title":"A Weighted Technique in Heuristic Search","authors":[{"name":"Bo Zhang","slug":"bo-zhang","given":"Bo","family":"Zhang","affiliation":""},{"name":"Ling Zhang","slug":"ling-zhang","given":"Ling","family":"Zhang","affiliation":""}],"abstract":"As shown in (1), we examine search as a statistic sampling proce s s. Based on some statistical infe rence method the probability that a subtree in search tree conteins the goal can be decided . Th us some weight is intentionaly added to the evaluation function of those nodes which are unlikely in the solution path so that the search will concentrate on the most promising p a th. It results in a new weig hte d a lgorithm-WSA. In a uniform m- ary tree, we show that a goal can be found by WSA in the polynomial time, although tßN computational complexity of A (or A*) may be O(e ) for searching the same space. Where N is the depth at which the goa l i s loc ated.","doi":null,"url":"https://ijcai.org/proceedings/1985/209","pdf":"https://ijcai.org/proceedings/1985/0209.pdf","markdown":"https://ijcai.org/proceedings/1985/209.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/209","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":209,"pages":{"first":1037,"last":1038},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}