activity
20122018
most citedA hybrid ACO approach to the Matrix Bandwidth Minimization Problem

13 citations · 37 across the 5 of their papers we have counts for

collaborators

6 papers

cs.MA2018★ 5 cited

Multi-agents features on Android platforms

Camelia-M. Pintea, Andreea Camelia Tripon, Anca Avram +1

The current paper shows the multi-agents capabilities to make a valid and flexible application when using a framework. Agent-based functions were used within JADE framework to make…

cs.AI2017

A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop

Andreas Holzinger, Markus Plass, Katharina Holzinger +3

The goal of Machine Learning to automatically learn from data, extract knowledge and to make decisions without any human intervention. Such automatic (aML) approaches show impressi…

cs.NE2014★ 5 cited

On the Resilience of an Ant-based System in Fuzzy Environments. An Empirical Study

Gloria Cerasela Crisan, Camelia-M. Pintea, Petrica C. Pop

The current work describes an empirical study conducted in order to investigate the behavior of an optimization method in a fuzzy environment. MAX-MIN Ant System, an efficient impl…

cs.AI2012★ 13 cited

A hybrid ACO approach to the Matrix Bandwidth Minimization Problem

Camelia-M. Pintea, Camelia Chira, Gloria-C. Crisan

The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matri…

cs.AI2012★ 13 cited

Soft Computing approaches on the Bandwidth Problem

Gabriela Czibula, Gloria Cerasela Crisan, Camelia-M. Pintea +1

The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous reordering of the rows and the columns of a square matrix such that the nonzero entries are collected with…

cs.AI2012★ 1 cited

Parallel ACO with a Ring Neighborhood for Dynamic TSP

Camelia-M. Pintea, Gloria Cerasela Crisan, Mihai Manea

The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distan…