Incomplete solution approach for the maximum clique finding in the real time systems

Authors:
Deniss Kumlander
Affiliations:
Department of Informatics, Tallinn University of Technology, Tallinn, Estonia
Venue:
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Year:
2006

Citing 7
Cited 2

Finding a maximum independent set in a permutation graph

Information Processing Letters
On-line bin-stretching

Theoretical Computer Science
On-line scheduling of parallel jobs with runtime restrictions

Theoretical Computer Science
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

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 fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization

Real-time systems: incomplete solution approach for the maximum-weighted clique problem

AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we are going to review how the maximum clique problem is solved in the real-time systems' environment. This environment is rarely considered by researches although a lot of applications are hosted there. The complexity of the maximum clique problem produces a conflict in such environment since real time systems usually want the answer after some small amount of time is elapsed. In this article we introduce an "incomplete solution" term. The "incomplete solution" approach allows fixing a point of a "ready-to-return" answer state in the real-time systems. We also review how best nowadays algorithms are performing in finding the maximum clique in the real-time environment and conclude about which on them can be successfully used.