Searching for authors named "Alexandre Mendes" – sorted by Relevance.
-
NP-Opt: an optimization framework for NP problems
- This paper presents a new object-oriented framework for optimization based on evolutionary computation techniques to address NP-hard problems. At present, the NP-Opt is customized to deal with five classes of problems. The level of code reutilization is high and allows the adaptation to new problems
- Cited by 2 (2 self) – Add To MetaCart
-
The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction
- The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples is an interesting and important problem. It is also one of the most useful problems with applications in many areas such a
- Cited by 2 (2 self) – Add To MetaCart
-
Integer Programming Models and Algorithms for Molecular Classification of Cancer from Microarray Data
- Novel, high-throughput technologies are challenging the core of algorithmic methods available in Computer Science. Microarray technologies give Life Sciences researchers the opportunity to simultaneously measure thousands of gene expression levels under different conditions or coming from different
- Cited by 2 (2 self) – Add To MetaCart
-
Memetic Algorithms To Minimize Tardiness On A Single Machine with Sequence-Dependent Setup
- The Single Machine Scheduling (SMS) problem is one of the most representative problems in the scheduling area. In this paper, we explore the SMS with time constraints (setup times and due-dates) and the objective function is the minimization of total tardiness. The chosen method is based on a hybrid
- Cited by 6 (3 self) – Add To MetaCart
-
Applying Memetic Algorithms to the Analysis of Microarray Data
- This work deals with the application of Memetic Algorithms to the Microarray Gene Ordering problem, a NP-hard problem with strong implications in Medicine and Biology. It consists in ordering a set of genes, grouping together the ones with similar behavior. We propose a MA, and evaluate the influenc
- Cited by 6 (3 self) – Add To MetaCart
-
A Hopfield Neural Network Approach to the Single Machine Scheduling Problem
- : The Single Machine Scheduling with Changeover Costs problem is found in many different workshops. In this case, the main criterion is the sequence-dependent changeovercosts or set-up times. This Scheduling problem can be modeled as a Traveling Salesman Problem (TSP) and when time constraints are i
- Add To MetaCart
-
Comparing Meta-Heuristic Approaches for Parallel Machine Scheduling Problems with Sequence Dependent Setup Times
- this paper is to compare the performance of two meta-heuristic methods proposed for solving the identical parallel machine scheduling problem with sequence dependent setup times. The first algorithm is a tabu search based heuristic and the second a memetic approach, which combines populationbased me
- Cited by 5 (3 self) – Add To MetaCart
-
Metaheuristic Approaches for the Pure Flowshop Manufacturing Cell Problem
- This article deals with the pure owshop manufacturing cell problem with sequence dependent family setup times. The objective is to minimize the makespan.
- Cited by 1 (1 self) – Add To MetaCart

