Stereo Correspondence Through Feature Grouping and Maximal Cliques
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Challenges of Real-Time AI
Computer
A new algorithm for the maximum-weight clique problem
Nordic Journal of Computing
Incomplete solution approach for the maximum clique finding in the real time systems
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Artificial intelligence in the maximum clique finding problem applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
Applying AI and incomplete solution principles to solve NP-hard problems in the real-time systems
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Improving the maximum-weight clique algorithm for the dense graphs
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
| Hi-index | 0.00 |
In this paper we are reviewing how the maximum-weight clique problem is solved in the real-time systems' environment by the best-known algorithms. The real-time environment is a quite unique one applying interesting restrictions on algorithms to be used and is rarely considered by researches although a lot of applications are hosted there. The main conflict to be researched here is produced by a time complexity of the maximum-weight clique problem and the real-time systems' requirement to solve a case during a predefined time interval. In this article an "incomplete solution" approach is used to explore maximum-weight clique algorithms performance.