Papers

3

Total Citations

29

H-Index

3

About

Camelia-M. Pintea is a Romanian computer scientist whose research sits at the intersection of metaheuristics, combinatorial optimization, and intelligent agent-based systems. Her work has made meaningful contributions to the field of bio-inspired computing, particularly in developing and refining ant-based algorithms and sensitive metaheuristic approaches for tackling complex optimization challenges. One of her notable contributions is the formulation of sensitive metaheuristics, adaptive algorithmic frameworks capable of efficiently navigating large and difficult optimization landscapes, as demonstrated in her 2008 paper which has garnered 12 citations. Pintea has also advanced the understanding of the Equality-Generalized Traveling Salesman Problem, a particularly demanding variant of the classic combinatorial puzzle, through comprehensive surveys of agent-based solution strategies, accumulating 8 citations. Beyond pure optimization, she has extended intelligent agent paradigms into cybersecurity, proposing conceptual models for protecting sensor networks using sensitive robot agents, a contribution recognized with 9 citations. Across her body of work, Pintea bridges theoretical algorithm design with practical applications in networking and security, offering researchers and students a rich interdisciplinary perspective on how nature-inspired computation can address real-world complexity.

Research Focus

Key Achievements

3
H-Index
3
Papers
29
Total Citations
10
Avg Citations/Paper
🏆 Most Cited Paper
A Sensitive Metaheuristic for Solving a Large Optimization Problem
12 citations · 2008
📈 Most Prolific Year: 2008 (1 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: Babeș-Bolyai University, Technical University of Cluj-Napoca

Top Papers

  1. 1
  2. 2
  3. 3

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 15 days ago