An AI-VCR technology of searching without information

Abstract

This paper promotes an AI-VCR technology of searching without information. VCR is an extension of FCR(Fixed Carrying Rules) which is also computation rules of FCN(Fixed Carrying Numbers). The FCN are some special examples of VCN(Variable Carrying Numbers). DFS(Depth-first Search) is a blind searching without information.In AI-VCR technology, AI(Artificial Intelligence) is used in dynamic designing computation rules of VCN. Both FCR and VCR in searching without information are variables of nodes' depth function. Finally, it gives out some examples of problem-solving method, namely problem-solving such as catching fish with casting a net or herdsman picks peaches with his fierce-looking before climbing up a tree. Keywords-AI-VCR technology; Depth-first Search(DFS);Fixed Carrying Rules(FCR); Artificial Intelligence(AI). I. PREFACEWhen to search a problem solving, we must think of the practicalities for searching methods, i.e. the specific searching methods must be correct, accurate, and feasible.Problem solving is a central problem of all researches of Artificial Intelligence (Alill. The problem solving and searches are bound to involve a great deal of that, reductions, inferences, planning, common knowledge reasoning, theorem proving, and the kernel concepts of associated process. For example, natural language processing, checking up information, automatic programming, robotics, scenery analyzing, game, expert system and mathematics theorem proving, etc. All of these synthetic concepts and their applications can be achieved by the method of running a certain program on Computer.The Search includes both of searching without information and searching with information. Searching without information is a blind searching, for example, the Breadth-first Search and the Depth-first Search, etc .. The searching with information is also called heuristic searching, it is a searching of which we can simplify searching processes by making use of information related to task( or problem-solving). The information related to task is called heuristic information. For example, the two significations algorithmic problem-solving of eliminating the hidden lines and surfaces in Computer Graphics(CG) all the time, the 3D visibility parameters which 3D solid reality pictures are showed in 2D plane, are heuristic information related to the two-signification problem solving.Moreover, problem-solving processes of some dynamic time-measuring in industry, the dynamic 978-1-4244-8217-7110/$26.00 ©2010 IEEE 94 parameters which are changing, for example, when the electronic belt scales are working, the speeds of belt which of loading material are heuristic information related to the dynamic time-measuring [31 . But here, this paper lays stress on analyzing and discussing about DFS in searching without information.