DocumentCode :
2219255
Title :
Granular Computing Applied to Heuristic Search Algorithm
Author :
Xia Hong-xia ; Zhang Ming-yuan ; Wu Jun
Author_Institution :
Comput. Sci. & Technol. Sch., Wuhan Univ. of Technol., Wuhan, China
fYear :
2009
fDate :
26-28 Dec. 2009
Firstpage :
3804
Lastpage :
3807
Abstract :
Granular Computing (GrC) is a new concept and novel approach to solve the complex problems and provide a method for massive data-searching in the field of artificial intelligence. This paper presents a novel method which combines the quotient space theory to the granular computing for analysis of the hierarchical structure and data searching. This method can simplify the original state-space effectively, so it is very meaningful to the heuristic search algorithm.
Keywords :
artificial intelligence; data handling; search problems; artificial intelligence; complex problems; granular computing; heuristic search algorithm; hierarchical structure; massive data searching; quotient space theory; Algorithm design and analysis; Artificial intelligence; Cost function; Data engineering; Heuristic algorithms; Humans; Inference algorithms; Information science; Problem-solving; Space technology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Science and Engineering (ICISE), 2009 1st International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-4909-5
Type :
conf
DOI :
10.1109/ICISE.2009.627
Filename :
5454999
Link To Document :
بازگشت