Camelia-M. Pintea | DeepAI

DeepAI AI Chat

Featured Co-authors

Andreas Holzinger
20 publications
Vasile Palade
17 publications
Camelia Chira
5 publications
Gloria Cerasela Crisan
5 publications
D. Dumitrescu
4 publications
Petrica C. Pop
3 publications
Markus Plass
3 publications
Anca Avram
2 publications
Oliviu Matei
2 publications
Gabriela Czibula
1 publication
Istvan-Gergely Czibula
1 publication

∙ 03/16/2021

Selective Survey: Most Efficient Models and Solvers for Integrative Multimodal Transport

In the family of Intelligent Transportation Systems (ITS), Multimodal Tr...

0 Oliviu Matei, et al. ∙

∙ 07/16/2018

Multi-agents features on Android platforms

The current paper shows the multi-agents capabilities to make a valid an...

0 Camelia-M. Pintea, et al. ∙

∙ 08/03/2017

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

The goal of Machine Learning to automatically learn from data, extract k...

0 Andreas Holzinger, et al. ∙

∙ 01/19/2014

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

The current work describes an empirical study conducted in order to inve...

0 Gloria Cerasela Crisan, et al. ∙

∙ 10/09/2013

The Generalized Traveling Salesman Problem solved with Ant Algorithms

A well known N P-hard problem called the Generalized Traveling Salesman ...

0 Camelia-M. Pintea, et al. ∙

∙ 10/10/2012

Comparing several heuristics for a packing problem

Packing problems are in general NP-hard, even for simple cases. Since no...

0 Camelia-M. Pintea, et al. ∙

∙ 08/28/2012

Soft Computing approaches on the Bandwidth Problem

The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneou...

0 Gabriela Czibula, et al. ∙

∙ 08/27/2012

Distributed Pharaoh System for Network Routing

In this paper it is introduced a biobjective ant algorithm for construct...

0 Camelia-M. Pintea, et al. ∙

∙ 08/27/2012

Sensitive Ants in Solving the Generalized Vehicle Routing Problem

The idea of sensitivity in ant colony systems has been exploited in hybr...

0 Camelia-M. Pintea, et al. ∙

∙ 08/27/2012

New results of ant algorithms for the Linear Ordering Problem

Ant-based algorithms are successful tools for solving complex problems. ...

0 Camelia-M. Pintea, et al. ∙

∙ 08/27/2012

A hybrid ACO approach to the Matrix Bandwidth Minimization Problem

The evolution of the human society raises more and more difficult endeav...

0 Camelia-M. Pintea, et al. ∙

∙ 08/24/2012

Parallel ACO with a Ring Neighborhood for Dynamic TSP

The current paper introduces a new parallel computing technique based on...

0 Camelia-M. Pintea, et al. ∙

∙ 08/24/2012

A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP

The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hard ...

0 Camelia-M. Pintea, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world