On places suitable for applying AI principles in NP-hard graph problems' algorithms

Kumlander, D. (2007). On places suitable for applying AI principles in NP-hard graph problems' algorithms. Proceedings of the IASTED Conference on Artificial Intelligence and Applications as part of the 25th IASTED International Multi-Conference on Applied Informatics: The IASTED International Conference on Artificial Intelligence and Applications (AIA 2007), Innsbruck, Austria, 12-14.02.2007. Ed. Devedžic, V. ACTA Press, 284−288.
publitseeritud konverentsiettekanne
Kumlander, D.
  • Inglise
Proceedings of the IASTED Conference on Artificial Intelligence and Applications as part of the 25th IASTED International Multi-Conference on Applied Informatics
Devedžic, V.
The IASTED International Conference on Artificial Intelligence and Applications (AIA 2007), Innsbruck, Austria, 12-14.02.2007
ACTA Press
9780889866294
2007
284288
Ilmunud
3.1. Artiklid/peatükid lisas loetletud kirjastuste välja antud kogumikes (kaasa arvatud Thomson Reuters Book Citation Index, Thomson Reuters Conference Proceedings Citation Index, Scopus refereeritud kogumikud)

Viited terviktekstile

Lisainfo

indekseerimine võttab circa 2 kuud
NP-hard, artificial intelligence, graph, clique
DBLP, ACTA