A plan recognition algorithm based on knowledge graph presented in this paper can change the plan recognition problem into the graph searching one. This method not only prompts efficiency but also gives the same result as Kautz's.
This result have unified the traditional explicit graph searching and implicit graph search, partial searching for one solution and complete searching for all solutions into a same model and some algorithms.
Based on the theory of artificial intelligence,by the method of graph searching in state space this article gives the method to define the optimum route in car navigation using the A and A * algorithm.
从人工智能原理出发，利用状态空间搜索的图搜索方式，采用 A 及 A算法，推导汽车导航中最佳路径的计算方法。
The method bases on active contour model,the contrast and Rayleigh distribution characteristics of IVUS image,effectively uses dynamic programming and heuristic graph searching,and automatically detects the intima and adventitia edge of IVUS image with the different cost functions.
TGSC uses fuzzy sets to describe temporal information about disorders, manifestations and relations between them. The basic framework of TGSC is built, the diagnostic problem solving method based on hypothesis graph searching presented, and an example is given.
In this paper,by introducing the concept of temporal consistent set covering,a diagnostic model named TGSC based on temporal reasoning and set covering is proposed. TGSC uses fuzzy sets to describe temporal information about disorders,manifestations and relations between them. The basic framework of TGSC is built,the diagnostic problem solving method based on hypothesis graph searching is presented,and an example is given.
This paper researchs two graph searching algorithms: A Algorithm and SQI. Algorithm. It uses database to store initiativedata in a graph and uses SQL to get A Algorithm's solution, it can simplify the programming in this area.
VCDS, which possesses fine software architecture and is easy to use, provides with dynamic demo functions for the familiar data structures including linear list, stack, queue, array, lists, binary tree, tree, graph, searching, and sorting and supports experiment programmed coded with many kinds of languages.
A semi-automated method for two- and three-dimensional analysis of intracardiac echocardiography (ICE) images and image sequences is reported based on detection of epicardial and endocardial borders using graph searching.
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
Graph Searching on Some Subclasses of Chordal Graphs
Our problem is an extension of so-called graph searching/guarding problem by considering the time slot parameter in addition to the traditional building cost.
Based on the evaluation, a potential field is constructed for graph searching.
In this paper, two general methods of establishing evaluation function h(n) in strategies of heuristic graph search are presented., similar problem approching method and function approching method, And some cdisussions on the two methods are made.
This Paper presents the concept of Random Production System (RPS) and its heuristic graph search algorithm RA* ,and proves that RA* is admissiable Finally this paper also discusses some characteristics of RA*