Camelia-Mihaela Pintea

Learn More
Background Many combinatorial optimization problems are NP-hard, and the theory of NP-completeness has reduced hopes that NP-hard problems can be solved within polynomially bounded computation times (Dahlke 2008; Dunne 2008). Nevertheless, sub-optimal solutions are sometimes easy to find. Consequently, there is much interest in approximation and heuristic(More)
Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The(More)
This paper investigates the integration of clinicopathological and microRNA data for breast cancer relapse prediction. Clinical and pathological data proved to be relevant in making predictions about cancer disease outcome. The most accurate predictive models can be obtained by using clinico-pathological information together with genomic information. We(More)
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 induced in the ant population by endowing individual ants with a certain level of sensitivity to the pheromone trail. The variable pheromone sensitivity within the same population(More)