| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Problem Solving, Control Methods, And Search (I.2.8) > Graph And Tree Search Strategies (I.2.8...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 46
Reviews about "Graph And Tree Search Strategies (I.2.8...)":
|
Date Reviewed |
| |
Shape classification using spectral graph wavelets
Masoumi M., Hamza A. Applied Intelligence 47(4): 1256-1269, 2017. Type: Article
Spectral analysis on a triangle mesh gained its popularity in shape retrieval due to the success of shape-DNA, which is easy to compute yet can achieve an accuracy of over 90 percent in some tests. The idea of bringing wavelet transfor...
|
Feb 15 2018 |
| |
Knowledge graph for TCM health preservation
Yu T., Li J., Yu Q., Tian Y., Shun X., Xu L., Zhu L., Gao H. Artificial Intelligence in Medicine 77 48-52, 2017. Type: Article
This paper introduces a knowledge graph for traditional Chinese medicine (TCM) health preservation....
|
Oct 12 2017 |
| |
The complexity of zero-visibility cops and robber
Dereniowski D., Dyer D., Tifenbach R., Yang B. Theoretical Computer Science 607, Pt. 2, 135-148, 2015. Type: Article
This paper concerns itself with the following problem: one has a graph and somewhere in the graph there is a “robber” who is invisible to the cops. The cops are to be placed on the graph and can move between the ver...
|
Mar 1 2016 |
| |
Graph based anomaly detection and description: a survey
Akoglu L., Tong H., Koutra D. Data Mining and Knowledge Discovery 29(3): 626-688, 2015. Type: Article
A consistent survey on anomaly detection and description is provided in this paper. This topic is extremely relevant due to the wide range of application domains. For this same reason, this topic is difficult to exhaustively address wi...
|
Sep 28 2015 |
| |
Merge-and-shrink abstraction: a method for generating lower bounds in factored state spaces
Helmert M., Haslum P., Hoffmann J., Nissim R. Journal of the ACM 61(3): 1-63, 2014. Type: Article
Pattern databases are heuristics used in search that rely on abstractions that aggregate states if they agree on a subset of the state variables. This paper considers a more general class of abstractions called merge-and-shrink abstrac...
|
Aug 6 2014 |
| |
Improvement of harmony search algorithm by using statistical analysis
Sarvari H., Zamanifar K. Artificial Intelligence Review 37(3): 181-215, 2012. Type: Article
Classical jazz performers and marching bands play different musical instruments that require harmonization to produce pleasant melodies. The synchronization of symphony orchestras has been attracting the attention of optimization resea...
|
Jul 13 2012 |
| |
COCONF: conceptual language-based configuration
Magro D. AI Communications 23(1): 1-46, 2010. Type: Article
The configuration problem is a classic problem in constraint satisfaction, with a history that goes back at least as far as R1 and Xcon, the rule-based systems for configuring Vaxen. Today, there are many configurators on the Web&#...
|
Nov 5 2010 |
| |
Solving the shortest path problem in vehicle navigation system by ant colony algorithm
Jiang Y., Wang W., Zhao Y. ISCGAV 2007 (Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision, Athens, Greece, Aug 24-26, 2007) 188-192, 2007. Type: Proceedings
This paper proposes a method of path search that is based on the ant colony algorithm. It aims to obtain a path that is as close as possible to the optimum solution, in a shorter time than existing algorithms, even when the route netwo...
|
Apr 20 2009 |
| |
Cleaning a network with brushes
Messinger M., Nowakowski R., Praat P. Theoretical Computer Science 399(3): 191-205, 2008. Type: Article
This well-written paper has interesting initial results on cleaning a graph. The authors consider the following model for cleaning edges of a graph:...
|
Nov 20 2008 |
| |
Monotonicity of non-deterministic graph searching
Mazoit F., Nisse N. Theoretical Computer Science 399(3): 169-178, 2008. Type: Article
Briefly, the problem of graph searching is stated as a game where a team of a certain number of searchers aims to capture a fugitive moving in a graph, either in an invisible way (the searchers ignore the position of the fugitive until...
|
Nov 18 2008 |
| |
|
|
| |
|
|
