58 citations · 97 across the 7 of their papers we have counts for
7 papers
Classifiers With a Reject Option for Early Time-Series Classification
Nima Hatami, Camelia Chira
Early classification of time-series data in a dynamic environment is a challenging problem of great importance in signal processing. This paper proposes a classifier architecture w…
The Generalized Traveling Salesman Problem solved with Ant Algorithms
Camelia-M. Pintea, Petrica C. Pop, Camelia Chira
A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters…
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…
Sensitive Ants in Solving the Generalized Vehicle Routing Problem
Camelia-M. Pintea, Camelia Chira, D. Dumitrescu +1
The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is in…
New results of ant algorithms for the Linear Ordering Problem
Camelia-M. Pintea, Camelia Chira, D. Dumitrescu
Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instance…
A Route Confidence Evaluation Method for Reliable Hierarchical Text Categorization
Nima Hatami, Camelia Chira, Giuliano Armano
Hierarchical Text Categorization (HTC) is becoming increasingly important with the rapidly growing amount of text data available in the World Wide Web. Among the different strategi…