By Topic

IFN Application in BFS of Artificial Intelligence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ye Qiu-Sun ; Dept. of Comput. Sci. & Eng., Wuyi Univ., Wuyishan

Breadth-first Searches (BFS) were both traditional & classical blind searching technique in artificial intelligence (AI). Variable Carrying Numbers (VCN) is a broad concept of numbers in number theory. AI-fuzzy VCN (IFN) is a mixture numbers with different Figures' Module (FM) in a same n-Figures number. Fixed Carrying Numbers (FCN) is only ones of special VCN. This paper makes an analyzing & discussing of BFS technology of both FCN and VCN in searching without information, and points out that, merits and demerits of two Numbers on searching without information. And then, it gives a novel IFN method of BFS in problem-solving which sometimes we should think simultaneously over the intelligent properties of VCN, and gives out an example of the problem-solving method, i.e. the problem-solving such as catching fish with casting a net or boy-herder picks peaches by climbing up a big tree.

Published in:

MultiMedia and Information Technology, 2008. MMIT '08. International Conference on

Date of Conference:

30-31 Dec. 2008