Factorization of combinatorial problems with blocking meta-heuristics

  • Authors:
  • Zurab Bosikashvili;Tamar Lominadze

  • Affiliations:
  • Department of Information Systems, Georgian Technical University, Tbilisi, Georgia;Department of Information Systems, Georgian Technical University, Tbilisi, Georgia

  • Venue:
  • ECC'09 Proceedings of the 3rd international conference on European computing conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Almost all the problems in artificial intelligence are characterized by exponential complexity. The scientists working in this sphere direct their efforts mainly to minimizing combinatorial "explosion", but, in spite of all, there is still much to think about. In this article we present a new metaheuristic-based model of solving combinatory problems, which allows solving problems automatically by means of abstracting, division and analogy principles.