Microsoft Word - LISTA toate PUBLICATIIle

Transcriere

1 Conform Metodologiei cadru, Art. 15, lista completă de lucrări a candidatului este structurata astfel: a) lista celor maximum 10 lucrări considerate de candidat a fi cele mai relevante pentru realizările profesionale proprii, care sunt incluse în format electronic în dosar şi care se pot regăsi şi în celelalte categorii de lucrări prevăzute de prezentul articol. Pentru ocuparea postului de professor universitar, lista lucrărilor va specifica care dintre lucrările prezentate sunt realizate după dobândirea atestatului de abilitare; b) teza sau tezele de doctorat; (1 teză de doctorat) c) brevete de invenţie şi alte titluri de proprietate industrială; d) cărţi şi capitole în cărţi; (5 lucrări) e) articole/studii in extenso, publicate în reviste din fluxul ştiinţific internaţional principal; (25 lucrări) f) publicaţii in extenso, apărute în lucrări ale principalelor conferinţe internaţionale de specialitate; (33 lucrări) g) alte lucrări şi contribuţii ştiinţifice sau, după caz, din domeniul creaţiei artistice. (24 lucrări) 1

2 a) Lista celor maximum 10 lucrări considerate de candidat a fi cele mai relevante pentru realizările profesionale proprii, care sunt incluse în format electronic în dosar şi care se pot regăsi şi în celelalte categorii de lucrări prevăzute de prezentul articol. 1. C-M.Pintea, G-C.Crişan, C.Chira, Hybrid Ant Models with a Transition Policy for Solving a Complex Problem, Logic Journal of the IGPL, Special issue: HAIS 2010 (Eds.M.Graña,E.Corchado, M.Wozniak), 10 pg.,oxford Univ.Press, 2011 (Print ISSN , Online ISSN ) 2. C-M. Pintea, C.Chira, D.Dumitrescu and C.P.Pop A sensitive metaheuristic for solving a large optimization problem,sofsem 2008, Springer, LNCS 4910, pp , (ISSN ) 3. C-M.Pintea, D.Dumitrescu, P.C.Pop: Combining Heuristics and Modifying Local Information to Guide Ant-based Search, Carpathian J.Math., 24(1), pp , 2008 (ISSN: ) 4. C.Chira, C-M.Pintea, D.Dumitrescu, A Multi-Agent Stigmergic Model for Complex Optimization Problems in "From Natural Language to Soft Computing: New Paradigms in Artificial Intelligence" pp.51-62, (L.A. Zadeh, D.Tufis, F.Gh. Filip, I.Dzitac; Eds.) Editing House of Romanian Academy,2008 (ISBN: ) 5. Pintea C-M., Pop P., Chira C., The Generalized Traveling Salesman Problem solved with Ant Algorithms, J.Universal Computer Science, 13(7), pp , (removed volume)(indexat in Scopus) 6. C.Chira, C.-M. Pintea, Gloria C. Crisan, D. Dumitrescu, Solving the Linear Ordering Problem using Ant Models, Proc. of the Genetic and Evolutionary Computation Conference (GECCO 09), (F.Rothlauf, Ed.), Montreal, Québec, Canada, ACM 2009, pp (ISBN ) 7. C.Chira, D. Dumitrescu, C.-M. Pintea, Heterogeneous Sensitive Ant Model for Combinatorial Optimization, Proc. of the 10-th Genetic and Evolutionary Computation Conference (GECCO 08), Atlanta, USA, Ant colony optimization, swarm intelligence, and artificial immune systems, ACM Publisher New York, USA pp , 2008 (ISBN: ) 8. P.Pop, C-M.Pintea, C.P.Sitar: An Ant-based Heuristic for the Railway Traveling Salesman Problem, Applications of Evolutionary Computing, (Eds.M. Giacobini et al.) Springer, LNCS 4448, pp ,2007 (ISSN ; ISBN: ) 9. C-M.Pintea, G.Negara: Solving Optimization Problems using an ACS- based Approach, Scientific Annals of the Al.I.Cuza University of Iasi, Computer Science Section, XVI:97-108, 2006 (ISSN: ) 10. C.Chira, D.Dumitrescu, C-M. Pintea, Learning sensitive stigmergic agents for solving complex problems, Computing and Informatics, 29(3), pp , Slovak Academic Press Ltd (ISSN ) 2

3 b) teza sau tezele de doctorat; Teza de doctorat: C-M.Pintea, Combinatorial optimization with bio-inspired computing (Optimizare Combinatorială cu Calcul Bio-inspirat), îndrumător prof. Dr.Dumitru Dumitrescu, Universitatea Babeş-Bolyai Cluj-Napoca c) brevete de invenție şi alte titluri de proprietate industrială; d) cărţi şi capitole în cărţi; (5 lucrări) 1. A.Vescan, C-M.Pintea, Component-based Ant Systems in "Modern Paradigms in Computer Science and Applied Mathematics", A Handbook for PhD Students and Researchers (Eds.B.Patrut, G-C.Crisan), Akademische Verlagsgemeinschaft München-AVM-GmbH&Co.KG, München, Germany, 2011 (ISBN ) 2. C-M.Pintea, Combinatorial optimization with bio-inspired computing, PhD thesis, Ed.EduSoft, (CNCSIS cod:157), 2010 (ISBN ) 3. C.Chira, C-M.Pintea, D.Dumitrescu, A Multi-Agent Stigmergic Model for Complex Optimization Problems in "From Natural Language to Soft Computing: New Paradigms in Artificial Intelligence" pp.51-62, (L.A. Zadeh, D.Tufis, F.Gh. Filip, I.Dzitac; Eds.) Editing House of Romanian Academy,2008 (ISBN: ) 4. C-M.Pintea, G.Negara,Applet-uri Java. Aplicatii., Ed.EduSoft (CNCSIS cod:157) 2007 (ISBN ) 5. C-M.Pintea, A.Vescan, C.Vescan, Grafica in Delphi,Ed.EduSoft (CNCSIS cod:157) 2008 (ISBN ) e) articole/studii in extenso, publicate în reviste din fluxul ştiinţific internaţional principal; (25 lucrări) 1. C-M.Pintea, G-C.Crişan, C.Chira, Hybrid Ant Models with a Transition Policy for Solving a Complex Problem, Logic Journal of the IGPL, Special issue: HAIS 2010 (Eds.M.Graña,E.Corchado, M.Wozniak), 10 pg., Oxford Univ.Press, 2011 (doi: /jigpal/jzr004) (Print ISSN , Online ISSN ) 2. C.Chira, D.Dumitrescu, C-M. Pintea, Learning sensitive stigmergic agents for solving complex problems, Computing and Informatics, 29(3), pp slovak Academic Press Ltd. 2010(ISSN ) 3. C-M.Pintea, D.Dumitrescu, P.C.Pop: Combining Heuristics and Modifying Local Information to Guide Ant-based Search, Carpathian J.Math., 24(1), pp , 2008 (ISSN: ) 4. C. Chira, C.M. Pintea, D. Dumitrescu, An Agent-Based Approach to Combinatorial Optimization, Int.J.Comput.Commun.Control, Vol 3, Suppl.pp , (ISSN: ) 5. C-M.Pintea, D.Dumitrescu The Importance of Parameters in Ant System, Int.J.Comput.Commun.Control, vol.i : , 2006 (ISSN: ) 3

4 6. Chira C., Pintea C-M., Dumitrescu D., Stigmergic Collaborative Agents, J. Universal Computer Science, 13(7), pp , 2007.(removed volume)(scopus) 7. Pintea C-M., Pop P., Chira C., The Generalized Traveling Salesman Problem solved with Ant Algorithms, J. Universal Computer Science, 13(7), pp , (removed volume)(scopus) 8. Pintea C-M., Sabau, S.V., Improving clustering based on ants phenotype matching, J.UCS, 13(7), pp , 2007 (removed volume)(scopus) 9. Czibula, G., Czibula, I.G., Pintea M.C, A Reinforcement Learning Approach for Solving the Matrix Bandwidth Minimization Problem, Studia Universitatis "Babes-Bolyai", Informatica, LV(4), pp , 10. C.-M. Pintea, C.Chira, D. Dumitrescu, New results of ant algorithms for the Linear Ordering Problem, An. Universitatiii de Vest, Timisoara, Seria Matematica-Informatica, vol. XLVIII (3), pp , 2010 (ISSN ) 11. G.C.Crisan, C.-M. Pintea, A Hybrid Heuristic for Solving the Triangulation Problem, Broad Research in Artificial Intelligence and Neuroscience(BRAIN) 1(2), 5-8, 2010(ISSN ) 12. P.C. Pop, C.M. Pintea, D. Dumitrescu, An Ant Colony Algorithm For Solving The Dynamic Generalized Vehicle Routing Problem, Special Issue the 5-th Conference, Dynamical systems and applications, ICSDA 2009, June 15-18, Constanta, Romania, Ovidius University Annals Series:Civil Engineering, Vol.1 (11), pp , C.Chira, C.-M. Pintea, D. Dumitrescu, A Step-Back sensitive ant model for solving complex problems, Special Issue Studia Univ. Babes-Bolyai Inform.: Proceedings of the Int.Conf. on Knowledge Engineering, Principles and Techniques, KEPT2009, , 2009(ISSN: X) 14. A.Vescan, C-M.Pintea: Ant Colony Component-based System for Traveling Salesman Problem, Applied Mathematical Sciences,.Ed. Hikari Ltd., 1(28), , 2007(ISSN: X) 15. C-M.Pintea, A.Vescan: Component-based Ant System for a Biobjective Assignment Problem, Studia Univ. Babes-Bolyai Informatica, LII(2), 21-32, 2007 (ISSN: X) 16. C-M.Pintea, D.Dumitrescu: Distributed Pharaoh System for Network Routing, Automation Computers Applied Mathematics (ACAM), 16 (1-2) 27-34, 2007 (ISSN: X)(MR ) 17. C.Chira, C-M.Pintea, D.Dumitrescu: Sensitive ant systems in combinatorial optimization, Special Issue Studia Univ. Babes-Bolyai Inform.: Proc Int. Conf. on Knowledge Engineering: Principles and Techniques, KEPT2007, , 2007 (ISSN: X) 18. C.Chira, C-M.Pintea, D.Dumitrescu Stigmergic Agent Optimization, Romanian Journal Information Science Technology, 9(3), pp , 2006 (ISSN: ) 19. C-M.Pintea, G.Negara: Solving Optimization Problems using an ACS- based Approach, Scientific Annals of the Al.I.Cuza University of Iasi, Computer Science Section, XVI : ,2006(ISSN: ) 20. C-M.Pintea, D.Dumitrescu Dynamically improving ant system, Automation Computers Applied Mathematics (ACAM), 15(1): 7-13, 2006 (ISSN: X) 4

5 21. A.Fanea, C-M.Pintea Component model for a NP-hard problem, An. Univ. Oradea Fasc. Mat., Oradea Univ., XII : , 2005(ISSN: ) 22. C-M.Pintea Optimal values in structures with pseudo-random generated elements, Creat.Math.&Info.., North Univ., Baia-Mare, 14:95-99, 2005 (ISSN X) 23. G.Serban, C-M.Pintea: Heuristical and Learning Approaches for the Traveling Salesman Problem, Stud Univ Babes-Bolyai Inform., XLIX(2), 27-36, 2004 (ISSN: X). 24. C-M.Pintea, C.Pintea: On a geometric locus related to hyperbola, Creat.Math. &Info, North Univ., Baia-Mare, 9: , 2000 (ISSN X) 25. C-M.Pintea, C.Pintea: The locus associated to an ellipsis, Creat.Math&Info., North Univ, Baia-Mare, 8: , 1999 (ISSN X) f) publicaţii in extenso, apărute în lucrări ale principalelor conferinţe internaţionale de specialitate; (33 lucrări) 1. C-M. Pintea, G-C. Crişan, C.Chira A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem, Hybrid Artificial Intelligent Systems, Part I, 5th International Conference, HAIS 2010, San Sebastian, Spain, June 23-25, Proceedings LNCS/LNAI 6076 pp (Eds.R.Manuel Grana; S.M.Teresa Garcia) Springer-Verlag Berlin Heidelberg 2010 (ISBN: ) 2. CM. Pintea, G.C. Crisan, C. Chira, D. Dumitrescu, A Hybrid Ant-Based Approach to the Economic Triangulation Problem for Input-Output Tables, Hybrid Artificial Intelligence Systems, 4th Int. Conf., HAIS 2009, Salamanca, Spain, June 10-12, Proc.LNCS 5572 pp ,(eds.e.corchado, X.Wu, E.Oja, Á.Herrero,B.Baruque) 2009 ( ISBN: ) 3. C.Chira, C.-M. Pintea, D. Dumitrescu, A New Exploration Mechanism for Sensitive Ant Models, Post-proceedings of KEPT 2009 Selected papers (Eds.M.Frentiu,H.F.Pop) pp , Ed. Presa Univ. Clujeana (ISSN ) 4. C.Chira, C-M.Pintea, D.Dumitrescu, Sensitive Stigmergic Agent Systems: ahybrid Approach to Combinatorial Optimization,Innovations in Hybrid Intelligent Systems, (Corchado E.; Corchado, J.M.;Abraham A., Eds.), Series:Advances in Soft Computing, Springer, vol. 44, 33-39, 2008 (ISBN ) 5. C.Chira, C.-M. Pintea, Gloria C. Crisan, D. Dumitrescu, Solving the Linear Ordering Problem using Ant Models, Proc. of the Genetic and Evolutionary Computation Conference (GECCO 09), (F.Rothlauf, Ed.), Montreal, Québec, Canada, ACM 2009, pp (ISBN ) 6. C-M.Pintea, C.Chira, D.Dumitrescu, Sensitive Ants: Inducing Diversity in the Colony, Nature Inspired Cooperative Strategies for Optimization (NICSO 2008), Series "Studies in Computational Intelligence", Vol. 236, pp ( Krasnogor, N.; Melián-Batista, B.; Moreno-Pérez, J.A.; Moreno-Vega, J.M.; Pelta, D.; Eds.) Springer Berlin/Heidelberg, 2009 (ISBN: ) 5

6 7. C.Chira, C-M.Pintea, D.Dumitrescu, Cooperative Learning Sensitive Agent System for Combinatorial Optimization, Nature Inspired Cooperative Strategies for Optimization (NICSO 2007) Series: Studies in Computational Intelligence (ISSN X), Vol. 129, pp , (Krasnogor,N.; Nicosia,G.; Pavone,M.; Pelta,D. ; Eds.) Springer Berlin/Heidelberg, 2008 (ISBN: ) 8. P.C.Pop, C.M.Pintea, I.Zelina, D.Dumitrescu:Solving the Generalized Vehicle Routing Problem with an ACS-based Algorithm, American Institute of Physics (AIP) Springer, Conference Proceedings: BICS 2008: Proc. 1st Int. Conf. Bio- Inspired Computational Methods Used for Solving Difficult Problems-- Development of Intelligent and Complex Systems, (Eds. B.L.Iantovics, C.Enachescu, F.Gh.Filip, Tg. Mures, Romania, 2008, 1117(1) pp , 2009 (ISBN: ) 9. C. Chira, D. Dumitrescu, C.-M. Pintea, Heterogeneous Sensitive Ant Model for Combinatorial Optimization, Proc. of the 10-th Genetic and Evolutionary Computation Conference (GECCO), Atlanta, USA, Ant colony optimization, swarm intelligence, and artificial immune systems, ACM Publisher New York, NY, USA pp , 2008 (ISBN: ) 10. C.Chira, C.M. Pintea, D. Dumitrescu, Multi-Population Agent Search: Stigmergy and Heterogeneity, 10th Int. Symp. on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'08), (Eds. V.Negru, T.Jebelean, D.Petcu, D.Zaharie), IEEE C.S.Press, 2008 (ISBN: ) 11. C-M. Pintea, C.P.Pop, C.Chira, D.Dumitrescu, A Hybrid Ant-based System for Gate Assignment Problem, HAIS2008, Springer, LNAI/LNCS 5271, pp , 2008 (ISBN ) 12. C. Chira, D. Dumitrescu, C-M. Pintea, Sensitive Ant Model for Combinatorial Optimization, New Aspects of Computers, Proc. of the 12th WSEAS Int. Conf. on COMPUTERS, Recent Advances in Computer Engineering, WSEAS Press, pp , 2008 (ISSN: ISBN: ) 13. C-M. Pintea, C.Chira, D.Dumitrescu and C.P.Pop A sensitive metaheuristic for solving a large optimization problem,sofsem 2008, Springer, LNCS 4910, pp , (ISSN ) 14. C.P.Pop, C-M. Pintea, C.P.Sitar, D.Dumitrescu: A Bio-inspired Approach for a Dynamic Railway Problem, Ninth Int. Symposium on Symbolic and Numeric Algorithms for Scientific Computing, IEEE C.S. Press, pp , 2007 (ISBN: ) 15. C-M. Pintea, P.C. Pop, D. Dumitrescu, An Ant-based Technique for the Dynamic Generalized Traveling Salesman Problem, Proc. of the 7-th WSEAS Int. Conf. on Systems Theory and Scientific Computation, pp , 2007 (ISSN: ; ISBN: ) 16. C.P.Pop, C-M.Pintea, C.P.Sitar : An Ant-based Heuristic for the Railway Traveling Salesman Problem, Applications of Evolutionary Computing, (Eds.M. Giacobini et al.) Springer, LNCS 4448, pp , 2007 (ISSN ; ISBN: ) 17. C-M.Pintea, C.Chira, D.Dumitrescu: Combining Meta-Heuristics to Solve the Rook Problem, Eighth Int.Symposium on Symbolic and Numeric Algorithms for 6

7 Scientific Computing, (Eds.V.Negru et al.) IEEE C.S. Press, pp , 2006 (ISBN: X) 18. C-M.Pintea, D.Dumitrescu: Improving ant systems using a local updating rule, Seventh Int. Symposium on Symbolic and Numeric Algorithms for Scientific Computing, (Eds.D.Zaharie et.al.), IEEE C.S. Press,pp , 2005 (ISBN: ) 19. C-M. Pintea, C. Chira, D. Dumitrescu, Results of Ant-Based Models for Solving the Linear Ordering Problem, NCA09, SYNASC 2009, Timisoara, Romania, IeAT Technical Report nr. 11/2009, pp. 2, C. Chira, C-M. Pintea, D. Dumitrescu, Stigmergy and Sensitivity in Heterogeneous Agent-Based Models, NCA08, SYNASC 2008, IeAT Technical Report 08-15, Timisoara, Romania, pp.13-17, C.Chira, D.Dumitrescu, C-M.Pintea: Sensitive Ant Model For Combinatorial Optimization, Proc. of MENDEL th International Conference on Soft Computing, Brno Univ. of Technology, Matousek, R.(Edt.) 2008(ISSN ) 22. C-M. Pintea, A. Vescan : The Labyrinth Problem: Component Model with Pharaoh System, Proc. Int. Conf. on Fundamental Science (ICFS 2007) Applied Mathematics and Computer Science section, Oradea, Eds. S.M.Filip, C.Popescu, H.Oros, Ed.Univ. Oradea, pp.82-86, 2007 ( ISBN: ) 23. C-M.Pintea, D.Dumitrescu: Introducing Pharaoh Ant System, Proc. of MENDEL th International Conference on Soft Computing, Brno Univ. of Technology, Eds. M. Radomil and P.Osmera, 54-59, 2007 (ISBN: ) 24. C.Chira, D.Dumitrescu, C-M.Pintea: Learning Sensitive Agents, Proc. of MENDEL th International Conference on Soft Computing, Brno Univ. of Technology, Eds. M. Radomil and P.Osmera, 60-65, 2007(ISBN: ) 25. P.C.Pop, C-M. Pintea, C.P.Sitar, D.Dumitrescu: Ant Colony Approach for a Dynamic Railway Problem, NCA Workshop of SYNASC Timisoara, 61-64, C.Chira, C-M.Pintea, D.Dumitrescu: Sensitive Stigmergic Agent Systems, Proc. of the 7-th ALAMAS Symposium, MICC Technical Report series, no.07-04, Eds. K.Tuyls, K.Verbeeck, S. de Jong, M. Posen, 51-57, 2007 (ISSN ) 27. A.Vescan, C-M.Pintea: Ant System. A component based model, Proc. ICCP06, IEEE Rom.Press, vol. 2, pp , 2006 (ISBN ) 28. C-M.Pintea, P.C.Pop, C.Chira: Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem, Proc. BIC-TA, vol. Evolutionary Computing, , C-M.Pintea, V.S.Sabau: Improving bio-inspired metaheuristics for data clustering, Proc. BIC-TA, vol. Evolutionary Computing, pp , C. Chira, C-M.Pintea, D. Dumitrescu: Stigmergic Agents for Solving NP-difficult Problems, Proc. BIC-TA, vol. Evolutionary Computing, , A.Fanea, C-M.Pintea:Comparative Models for a Combinatorial Problem,Proc.ICC06, IEEE Press, pp , 2006 (ISBN: ) 7

8 32. C-M.Pintea, C.Chira, D.Dumitrescu: Agent-based approaches for the rook problem, ACSys'06 Workshop, SYNASC Timisoara, 42-46, D.Dumitrescu, C-M.Pintea: Inner-Update System for Traveling Salesman Problem, NCA 05 Workshop SYNASC, Timisoara, 26-30, 2005 g) alte lucrări şi contribuţii ştiinţifice sau, după caz, din domeniul creaţiei artistice. (24 lucrări) 1. G.C.Crisan, C-M.Pintea, A hybrid technique for a matrix bandwidth problem, abstract book "Gheorghe Vrănceanu" National Conference on Mathematics and Informatics with international participation NCMI2011 Bacau, pp.9, C-M.Pintea, A.Vescan, Bio-inspired components for a bandwidth problem, abstract book "Gheorghe Vrănceanu" National Conference on Mathematics and Informatics with international participation NCMI2011 Bacau, pp.15, G.Czibula, G-C.Crisan, C.-M. Pintea, I-G. Czibula, Soft Computing approaches on the Bandwidth problem Abstracts of ICAM 7, International Conference of Applied Mathematics, Romania, Baia-Mare, Sept. 1-4, C.-M. Pintea, C. Chira, D. Dumitrescu, P.C. Pop, Sensitive Ants in Solving the Generalized Vehicle Routing Problem, Abstracts of ICCCC Papers (Eds. I. Dzitac, F.G. Filip, M.-J. Manolescu,) International Conference on Computers, Communications & Control ICCCC 2010, Romania, Oradea, Baile Felix, May 12-16, 2010, Vol.2 (2010), ISSN Chira C.,Pintea C.-M., Dumitrescu D., An Agent-Based Approach to Combinatorial Optimization, abstract 20, (Eds. I. Dzitac, S. Dzitac, L. Galea, H.Oros), Abstracts of ICCCC Papers: ICCCC 2008 (ISSN C-M.Pintea, D. Dumitrescu, Network Routing using Pharaoh System, abstract for The Eleventh Int.Conf. on Applied Mathematics, Computer Science and Mechanics, Angheluta Workshop, Tech.Univ. Cluj-Napoca, 31-32, C-M.Pintea, C.Chira, P.C. Pop, D. Dumitrescu: A Sensitive Robot Metaheuristic for Complex Applications, abstract in Proc. of the 6-th Int. Conf. on Large- Scale Scientific Computations, pp.b-52, C-M.Pintea, D.Dumitrescu: A dynamic approach for improving ant system, abstract for The Tenth Int.Conf. on Applied Mathematics, Computer Science and Mechanics, Angheluta Workshop 2006, Cluj-Napoca-Baisoara, , C-M.Pintea: A clustering model based on ant-system, abstract for ICAM5, pp. 38, Baia Mare, C.Chira, C-M.Pintea, D.Dumitrescu: A Multi-Agent Approach to Distributed Collaboration, abstract for MaCS06, ed. Z.Csornyei., Pécs Univ., Hungary, pp. 26, C-M. Pintea, Camelia Chira, D.Dumitrescu, Petrica C.Pop, A complex optimization problem solved with a sensitive metaheuristic, Computational Intelligence Reports No. 03, 6 pages, 2008 (ISSN X) 8

9 12. C.-M.Pintea, P.C.Pop, C.Chira, D.Dumitrescu, Hybridization of a Bio-inspired Algorithm for an Over-constrained Assignment Problem, Computational Intelligence Reports No. 06, 6 pages, 2008 (ISSN X) 13. C.Chira, D.Dumitrescu, C.-M.Pintea, Heterogeneous Sensitive Ant Model for Combinatorial Optimization Problems, Computational Intelligence Reports No. 08, 14 pages, 2008 (ISSN X) 14. C.Chira, C.-M.Pintea, D.Dumitrescu, Stigmergy and Sensitivity in Multi-Agent Models, Computational Intelligence Reports No. 10, 9 pages, 2008 (ISSN X) 15. C. Chira, Camelia Pintea and D. Dumitrescu, Sensitivity and Stigmergy in Agent- Based Systems, Computational Intelligence Reports No , 7 pages, (February 2007) (ISSN X) 16. C. Chira, Camelia Pintea and D. Dumitrescu, A Hybrid Agent-Based Approach to Combinatorial Optimization, Computational Intelligence Reports No , 6 pages, (June 2007) (ISSN X) 17. C.Chira, C-M.Pintea, D.Dumitrescu: Stigmergic Agents, Comp. Intel. Rep , October, 9 pages, 2006 (ISSN X) 18. A.Vescan, C-M.Pintea: Modeling Ant System for TSP, Comp. Intel. Rep , September, 11 pages, 2006 (ISSN X) 19. C.Chira, C-M.Pintea, D. Dumitrescu: NewMetaheuristics for Distributed Computing, Comp.Intel.Rep , June, 17 pag (ISSN X) 20. C-M.Pintea, D.Dumitrescu: Modifying local information to guide ant colony based search, Comp.Intel.Rep , Jan.16 pag (ISSN X) 21. A.Fanea, C-M.Pintea: Classical approach on modeling the Traveling Salesman Problem, Comp.Intel.Rep , Dec.8 pag (ISSN X) 22. C-M.Pintea, D.Dumitrescu: Solving Traveling Salesman Problem using a new ant-based mechanism, Computational Intelligent Reports Tech.Rep , October, 11pages, 2005, (ISSN X) 23. C-M.Pintea: Elementary Clustering, Gazeta Informatica, Babel-section, 15/8, 2005 (ISSN ) 24. C-M.Pintea: A New Ant Colony System Technique for the Traveling Salesman Problem, Proceeding Zilele Academice Clujene, Babes-Bolyai Univ., ,