{"id":1081,"date":"2019-02-18T09:28:43","date_gmt":"2019-02-18T09:28:43","guid":{"rendered":"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/?page_id=1081"},"modified":"2019-09-25T07:58:58","modified_gmt":"2019-09-25T07:58:58","slug":"inteligenta-artificiala-2018-2019","status":"publish","type":"page","link":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/research\/all-years\/inteligenta-artificiala-2018-2019\/","title":{"rendered":"Inteligenta artificiala 2018-2019"},"content":{"rendered":"<p><span style=\"color: #ff0000;\"><strong>Anunt: examenul in sesiunea de restante se desfasoara luni, 8 iulie, astfel:<\/strong><\/span><\/p>\n<ul>\n<li>scris: ora 11, sala C335<\/li>\n<li>preluare laboratoare: ora 12, sala C306<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<p><strong>Echipa<\/strong>:\u00a0Laura Diosan,\u00a0Dragos Dobrean, Sergiu Limboi, Gabriel Mircea<\/p>\n<table width=\"860\">\n<tbody>\n<tr>\n<td width=\"710\"><strong>Evaluare<\/strong><br \/>\nASSERT (NrPrezenteSeminar &gt;= 6)<br \/>\nASSERT (NrPrezenteLab &gt;= 6)<br \/>\nASSERT (NrPuncteUnLaboratorPredat &gt;= LimMinimaLab)<br \/>\nASSERT(existaMinim3LaboratoarePredate == True)<br \/>\nASSERT(nrPunctePeUnLaboratorNepredat == 0)<br \/>\nASSERT(nrPunctePeActivitateaDeSeminar == nr puncte pt participarea <strong>activa<\/strong> la seminarii)<br \/>\nASSERT(0 &lt;= nrPuncteSeminar &lt;= 700)<br \/>\nASSERT(1000 &lt;= nrPuncteExamenScris &lt;= 4000)<\/td>\n<td width=\"120\"><strong>Punctaj <\/strong><br \/>\n&lt;2001<br \/>\n[2001, 3 000]<br \/>\n[3001, 4 500]<br \/>\n[4501, 6 500]<br \/>\n[6501, 8 500]<br \/>\n[8501, 10 000]<br \/>\n&gt;10 000<\/td>\n<td width=\"30\"><strong>Nota<\/strong><br \/>\n<strong>4<\/strong><br \/>\n<strong>5<\/strong><br \/>\n<strong>6<\/strong><br \/>\n<strong>7<\/strong><br \/>\n<strong>8<\/strong><br \/>\n<strong>9<\/strong><br \/>\n<strong>10<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p><strong>Nota<\/strong>: regulile de mai sus se aplica si in sesiunea de restanta. In sesiunea de restante, se mai pot preda laboratoare doar pana la indeplinirea conditiei minimale (ASSERT(existaMinim3LaboratoarePredate == True)), iar punctajul primit pentru o tema predata va fi punctajul minim corespunzator temei (indiferent de calitatea rezolvarii). Activitatea de seminar nu se poate recupera. Nu se pot preda rezolvari pentru obtinerea de puncte bonus.<\/p>\n<p><strong>Reguli<\/strong> <a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/rules.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/p>\n<p><strong>Situatie punctaje<\/strong>\u00a0<a href=\"https:\/\/docs.google.com\/spreadsheets\/d\/1IISVedbfU56SFcuF7I0-et5L65CcrKS_U0z9nQAPDVs\/edit?usp=sharing\" target=\"_blank\" rel=\"noopener\">link<\/a><\/p>\n<p>&nbsp;<\/p>\n<table style=\"height: 1858px;\" border=\"0\" width=\"879\" cellspacing=\"0\" cellpadding=\"0\">\n<tbody>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">Sapt<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Curs<\/span><\/td>\n<td width=\"338\"><span style=\"color: #000000;\">Bibliografie<\/span><\/td>\n<td width=\"48\"><span style=\"color: #000000;\">Seminar<\/span><\/td>\n<td width=\"48\"><span style=\"color: #000000;\">Lab<\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S1<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Organizatorice &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/00_admin.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><br \/>\n<span style=\"color: #000000;\"> Introducere \u00een IA &#8211;<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/01_introAI.pdf\" target=\"_blank\" rel=\"noopener\"> ro<\/a><\/span><br \/>\n<span style=\"color: #000000;\"> Metode de c\u0103utare<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; metode neinformate si informate, Hill Climbing, Simulated Annealing, Tabu Search &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/01_search_uninformed.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele I.1, I.2, II.3, II.4 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele 1 &#8211; 4 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolele 2.1 \u2013 2.5 din <a style=\"color: #000000;\" href=\"http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/\">http:\/\/www-g.eng.cam.ac.uk\/mmg\/teaching\/artificialintelligence\/<\/a><\/span><\/li>\n<\/ul>\n<\/td>\n<td rowspan=\"2\" width=\"48\"><span style=\"color: #000000;\">Metode de c\u0103utare <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/sem\/sem01_extins.pdf\" target=\"_blank\" rel=\"noopener\">sem<\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"48\"><span style=\"color: #000000;\">Metode de cautare &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/tema01_search.pdf\" target=\"_blank\" rel=\"noopener\"> ro <\/a><\/span><\/p>\n<p><span style=\"color: #000000;\">exempleDate\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/lab1data.zip\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S2<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Metode de c\u0103utare<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; Algoritmi Evolutivi &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/02_local_search_EAs.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a> (suplim &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/02_local_search_EA_suplim.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a>) <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/MonkeyGA.zip\" target=\"_blank\" rel=\"noopener\">exemplu Monkey<\/a><\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 14 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1998<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 7.6 din A. A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul 9 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S3<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Metode de c\u0103utare- Algoritmi inspira\u0163i de furnici, algoritmi inspira\u0163i de inteligen\u0163a de grup) &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/03_local_search_PSO_ACO.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a>&#8211;<\/span><\/p>\n<p><span style=\"color: #000000;\">Metode de c\u0103utare adversial\u0103 &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/03_adversial_search.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 16 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">James Kennedy, Russel Eberhart, Particle Swarm<br \/>\nOptimisation, Proceedings of IEEE International Conference<br \/>\non Neural Networks. IV. pp. 1942\u20131948, 1995<br \/>\n(05_ACO_PSO\/PSO_00.pdf)<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Marco Dorigo, Christian Blum, Ant colony optimization<br \/>\ntheory: A survey, Theoretical Computer Science 344 (2005)<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul II.5 din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 6 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<\/ul>\n<\/td>\n<td rowspan=\"2\" width=\"104\"><span style=\"color: #000000;\">Metode de c\u0103utare <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/sem\/sem02_extins.pdf\" target=\"_blank\" rel=\"noopener\">sem<\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"100\"><span style=\"color: #000000;\">Metode de c\u0103utare &#8211; <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/tema02_search.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S4<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; problematica <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/04_ML_intro.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><br \/>\n<span style=\"color: #000000;\"> Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (least square, gradient descent)\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/05_GD.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a>\u00a0\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/GDcode.zip\" target=\"_blank\" rel=\"noopener\">ex<\/a><\/span><\/td>\n<td rowspan=\"7\" width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul VI (18) din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 8 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">capitolul 10, 11, 12, 13, 15 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul V din D. J. C. MacKey, Information Theory, Inferenceand Learning Algorithms, Cambridge University Press, 2003<\/span><\/li>\n<li><span style=\"font-size: xx-small; color: #000000;\">Capitolul 3 si 4 din T. M. Mitchell, Machine Learning, McGraw-Hill Science, 1997<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S5<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (ANN) <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/06_ann.pdf\" target=\"_blank\" rel=\"noopener\">ro <\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"104\"><span style=\"color: #000000;\">Regresie <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/sem\/sem03_extins.pdf\" target=\"_blank\" rel=\"noopener\">sem<\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"100\"><span style=\"color: #000000;\">Regresie <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/tema03_regression.pdf\" target=\"_blank\" rel=\"noopener\"> link<\/a>\u00a0exempleDate\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/lab3data.zip\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S6<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">\u00a0Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (ANN) <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/ANNcode.zip\" target=\"_blank\" rel=\"noopener\">ex<\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S7<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (SVM, decision trees)\u00a0 <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/07_SVM_decTrees.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"104\"><span style=\"color: #000000;\">Clasificare <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/sem\/sem04_extins.pdf\" target=\"_blank\" rel=\"noopener\">sem<\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"100\"><span style=\"color: #000000;\">Clasificare <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/tema04_classification.pdf\" target=\"_blank\" rel=\"noopener\"> link<\/a>\u00a0exempleDate\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/lab4data.zip\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S8<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata supervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (kNN, GP)\u00a0\u00a0 <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/08_kNN_GP.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S9<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata nesupervizata<\/span><br \/>\n<span style=\"color: #000000;\"> &#8211; algoritmi (kMeans) <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/09_kMeans.pdf\" target=\"_blank\" rel=\"noopener\"> ro<\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"104\"><span style=\"color: #000000;\">Regresie si clasificare <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/sem\/sem05_extins.pdf\" target=\"_blank\" rel=\"noopener\">sem<\/a><\/span><\/td>\n<td rowspan=\"2\" width=\"100\"><span style=\"color: #000000;\">Regresie si clasificare <a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/tema05_regressionClassification.pdf\" target=\"_blank\" rel=\"noopener\"> link <\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S10 (6 mai)<\/span><\/td>\n<td width=\"349\"><span style=\"color: #000000;\">Invatare automata &#8211; regularisation\u00a0<a style=\"color: #000000;\" href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/11_regularisation.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/span><\/td>\n<\/tr>\n<tr>\n<td width=\"48\"><span style=\"color: #000000;\">S11 (13 mai)<\/span><\/td>\n<td width=\"349\"><span style=\"color: #ff0000;\"><strong>Invited lecture: Philipp Kandal, SVP Engineering Telenav\u00a0<span style=\"color: #000000;\"><a style=\"color: #000000;\" href=\"https:\/\/kandal.com\/\" target=\"_blank\" rel=\"noopener\">link<\/a><\/span>\u00a0\u00a0<\/strong><\/span><\/td>\n<td width=\"338\"><\/td>\n<td rowspan=\"2\" width=\"104\">Regresie si clasificare <a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/sem\/sem06_extins.pdf\" target=\"_blank\" rel=\"noopener\">sem<\/a><\/td>\n<td rowspan=\"2\" width=\"100\">Proiecte &#8211; <a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/labs\/projects.pdf\" target=\"_blank\" rel=\"noopener\">link<\/a><\/p>\n<p>&nbsp;<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S12<\/td>\n<td width=\"349\">Invatare automata semi-supervizata<a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/12_semisupervised.pdf\" target=\"_blank\" rel=\"noopener\"> ro<\/a><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small;\">capitolul III din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 4 \u015fi 5 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 2 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 6 \u015fi 7 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S13<\/td>\n<td width=\"349\">Sisteme inteligente<br \/>\n&#8211; sisteme bazate pe reguli \u00een medii certe <a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/10_KBS.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small;\">capitolul III din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 4 \u015fi 5 din H.F. Pop, G. \u015eerban, Inteligen\u0163\u0103 artificial\u0103, Cluj Napoca, 2004<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 2 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 6 \u015fi 7 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n<td rowspan=\"2\" width=\"104\">Invatare nesupervizata<\/td>\n<td rowspan=\"2\" width=\"100\"><\/td>\n<\/tr>\n<tr>\n<td width=\"48\">S14 (3 iunie)<\/td>\n<td width=\"349\"><span style=\"color: #ff0000;\"><strong>Invited lecture: Catalin Zima, Evozone <a href=\"http:\/\/www.cs.ubbcluj.ro\/~lauras\/test\/docs\/school\/IA\/2018-2019\/lectures\/games.pdf\" target=\"_blank\" rel=\"noopener\">ro<\/a><\/strong><\/span><\/td>\n<td width=\"338\">\n<ul>\n<li><span style=\"font-size: xx-small;\">capitolul V din S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 3 din Adrian A. Hopgood, Intelligent Systems for Engineers and Scientists, CRC Press, 2001<\/span><\/li>\n<li><span style=\"font-size: xx-small;\">capitolul 8 \u015fi 9 din C. Gro\u015fan, A. Abraham, Intelligent Systems: A Modern Approach, Springer, 2011<\/span><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Anunt: examenul in sesiunea de restante se desfasoara luni, 8 iulie, astfel: scris: ora 11, sala C335 preluare laboratoare: ora 12, sala C306 &nbsp; Echipa:\u00a0Laura Diosan,\u00a0Dragos Dobrean, Sergiu Limboi, Gabriel Mircea Evaluare ASSERT (NrPrezenteSeminar &gt;= 6) ASSERT (NrPrezenteLab &gt;= 6) ASSERT (NrPuncteUnLaboratorPredat &gt;= LimMinimaLab) ASSERT(existaMinim3LaboratoarePredate == True) ASSERT(nrPunctePeUnLaboratorNepredat == 0) ASSERT(nrPunctePeActivitateaDeSeminar == nr puncte pt [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":32,"menu_order":7,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1081"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/comments?post=1081"}],"version-history":[{"count":47,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1081\/revisions"}],"predecessor-version":[{"id":1188,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/1081\/revisions\/1188"}],"up":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/pages\/32"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~lauras\/wp-json\/wp\/v2\/media?parent=1081"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}