Search

Your search keyword '"Sabo, Cosmin"' showing total 31 results
Start Over Author "Sabo, Cosmin"
31 results on '"Sabo, Cosmin"'

2. Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models

Author

Cosma, Ovidiu, Pop, Petrică, Sabo, Cosmin, Cosma, Laura, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, García Bringas, Pablo, editor, Pérez García, Hilde, editor, Martínez de Pisón, Francisco Javier, editor, Villar Flecha, José Ramón, editor, Troncoso Lora, Alicia, editor, de la Cal, Enrique A., editor, Herrero, Álvaro, editor, Martínez Álvarez, Francisco, editor, Psaila, Giuseppe, editor, Quintián, Héctor, editor, and Corchado, Emilio, editor

Published
2023
Full Text
View/download PDF

4. A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code

Author

Petrovan, Adrian, Pop, Petrică C., Sabo, Cosmin, Zelina, Ioana, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, García Bringas, Pablo, editor, Pérez García, Hilde, editor, Martínez de Pisón, Francisco Javier, editor, Villar Flecha, José Ramón, editor, Troncoso Lora, Alicia, editor, de la Cal, Enrique A., editor, Herrero, Álvaro, editor, Martínez Álvarez, Francisco, editor, Psaila, Giuseppe, editor, Quintián, Héctor, editor, and Corchado, Emilio, editor

Published
2022
Full Text
View/download PDF

6. Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm

Author

Cosma, Ovidiu, Pop, Petrica, Sabo, Cosmin, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Herrero, Álvaro, editor, Cambra, Carlos, editor, Urda, Daniel, editor, Sedano, Javier, editor, Quintián, Héctor, editor, and Corchado, Emilio, editor

Published
2021
Full Text
View/download PDF

7. A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes

Author

Cosma, Ovidiu, Pop, Petrica C., Sabo, Cosmin, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Chatzigeorgiou, Alexander, editor, Dondi, Riccardo, editor, Herodotou, Herodotos, editor, Kapoutsis, Christos, editor, Manolopoulos, Yannis, editor, Papadopoulos, George A., editor, and Sikora, Florian, editor

Published
2020
Full Text
View/download PDF

8. An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem

Author

Cosma, Ovidiu, Pop, Petrica C., Sabo, Cosmin, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Pérez García, Hilde, editor, Sánchez González, Lidia, editor, Castejón Limas, Manuel, editor, Quintián Pardo, Héctor, editor, and Corchado Rodríguez, Emilio, editor

Published
2019
Full Text
View/download PDF

15. Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach

Author

Pintea, Camelia-M., Calinescu, Anisoara, Pop, Petrica C., Sabo, Cosmin, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Graña, Manuel, editor, López-Guede, José Manuel, editor, Etxaniz, Oier, editor, Herrero, Álvaro, editor, Quintián, Héctor, editor, and Corchado, Emilio, editor

Published
2017
Full Text
View/download PDF

16. A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem

Author

Pop, Petrica, Oliviu, Matei, Sabo, Cosmin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Martínez de Pisón, Francisco Javier, editor, Urraca, Rubén, editor, Quintián, Héctor, editor, and Corchado, Emilio, editor

Published
2017
Full Text
View/download PDF

22. On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times.

Author

Cosma, Ovidiu, Pop, Petrica, and Sabo, Cosmin

Subjects
SUPPLY chains, LEAD time (Supply chain management), GENETIC algorithms
Abstract

Supply chain network design (SCND) is the process for designing and modeling the supply chain such that to minimize the costs generated by the location of facilities and the flow of product between the selected facilities. The aim of this paper is to investigate a particular SCND, namely the two-stage supply chain network design problem with risk-pooling and lead times and to provide a novel efficient and effective genetic algorithm (GA) designed to fit the challenges of the considered optimization problem. Extensive computational experiments were performed on two sets of instances and the achieved results prove the performance of our proposed GA. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

23. Forecasting the Number of Bugs and Vulnerabilities in Software Components using Neural Network Models

Author

Cosma, Ovidiu, Petrică Pop, Sabo, Cosmin, and Cosma, Laura

Subjects
Security, Software vulnerabilities, Forecasting, Neural networks
Abstract

The frequency of cyber attacks has been rising rapidly lately, which is a major concern. Because each attack exploits one or more vulnerabilities in the software components that make up the targeted system, the number of vulnerabilities is an indication of the level of security and trust that these components provide. In addition to vulnerabilities, the security of a component can also be affected by software bugs, as they can turn into weaknesses, which if exploited can become vulnerabilities. This paper presents a comparison of several types of neural networks for forecasting the number of software bugs and vulnerabilities that will be discovered for a software component in certain timeframe, in terms of accuracy, trainability and stability to configuration parameters.

Published
2022
Full Text
View/download PDF

26. Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm.

Author

Cosma, Ovidiu, Pop, Petrică C, and Sabo, Cosmin

Subjects
OVERHEAD costs, SUPPLY chains, LINEAR programming
Abstract

In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results