Segui
Leonardo Lai
Leonardo Lai
Intel Corporation
Email verificata su intel.com
Titolo
Citata da
Citata da
Anno
Solving mixed Pareto-Lexicographic multi-objective optimization problems: The case of priority chains
L Lai, L Fiaschi, M Cococcioni
Swarm and Evolutionary Computation 55, 100687, 2020
302020
Solving mixed pareto-lexicographic multiobjective optimization problems: The case of priority levels
L Lai, L Fiaschi, M Cococcioni, K Deb
IEEE Transactions on Evolutionary Computation 25 (5), 971-985, 2021
192021
Handling Priority Levels in Mixed Pareto-Lexicographic Many-Objective Optimization Problems
L Lai, L Fiaschi, M Cococcioni, K Deb
EMO 2021 - 11th Edition of International Conference Series on Evolutionary …, 2021
82021
Pure and mixed lexicographic-paretian many-objective optimization: state of the art
L Lai, L Fiaschi, M Cococcioni, K Deb
Natural Computing 22 (2), 227-242, 2023
62023
Ultra-low latency nfv services using dpdk
L Lai, G Ara, T Cucinotta, K Kondepu, L Valcarenghi
2021 IEEE Conference on Network Function Virtualization and Software Defined …, 2021
42021
Automatic parking with Q-Learning
L Lai
In Eastern European Machine Learning Summer School, 2021
22021
A Framework for Comparative Evaluation of High-Performance Virtualized Networking Mechanisms
G Ara, L Lai, T Cucinotta, L Abeni, C Vitucci
Cloud Computing and Services Science 1399, 59--83, 2021
22021
On the Use of Grossone Methodology for Handling Priorities in Multi-objective Evolutionary Optimization
L Lai, L Fiaschi, M Cococcioni, K Deb
Numerical Infinities and Infinitesimals in Optimization, 183-218, 2022
2022
Implementation and Evaluation of High-Performance Userspace Networking Mechanisms for Virtualized Network Functions
L LAI
2020
New flexible, reliable and secure logging channel for distributed workflows
L Lai
2019
Aboul Hosn, Bassel, 87 Abranches, Marcelo, 28 Afrasiabi, Seyedeh Negar, 41
R Aguiar, H Ahmadvand, A Al-Jawad, J Alegria, C Angelis, G Ara, ...
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–11