Mobile traffic forecasting for maximizing 5G network slicing resource utilization
V Sciancalepore, K Samdanis… - … -IEEE conference on …, 2017 - ieeexplore.ieee.org
The emerging network slicing paradigm for 5G provides new business opportunities by
enabling multi-tenancy support. At the same time, new technical challenges are introduced …
enabling multi-tenancy support. At the same time, new technical challenges are introduced …
RL-NSB: Reinforcement learning-based 5G network slice broker
V Sciancalepore, X Costa-Perez… - IEEE/ACM transactions …, 2019 - ieeexplore.ieee.org
Network slicing is considered one of the main pillars of the upcoming 5G networks. Indeed,
the ability to slice a mobile network and tailor each slice to the needs of the corresponding …
the ability to slice a mobile network and tailor each slice to the needs of the corresponding …
[图书][B] Principles of automated negotiation
With an increasing number of applications in the context of multi-agent systems, automated
negotiation is a rapidly growing area. Written by top researchers in the field, this state-of-the …
negotiation is a rapidly growing area. Written by top researchers in the field, this state-of-the …
Approximation algorithms for knapsack problems with cardinality constraints
We address a variant of the classical knapsack problem in which an upper bound is
imposed on the number of items that can be selected. This problem arises in the solution of …
imposed on the number of items that can be selected. This problem arises in the solution of …
z-TORCH: An automated NFV orchestration and monitoring solution
V Sciancalepore, FZ Yousaf… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Autonomous management and orchestration (MANO) of virtualized resources and services,
especially in large-scale network function virtualization (NFV) environments, is a big …
especially in large-scale network function virtualization (NFV) environments, is a big …
Approximating knapsack and partition via dense subset sums
Knapsack and Partition are two important additive problems whose fine-grained
complexities in the (1—ε)-approximation setting are not yet settled. In this work, we make …
complexities in the (1—ε)-approximation setting are not yet settled. In this work, we make …
Selecting highly optimal architectural feature sets with filtered cartesian flattening
J White, B Dougherty, DC Schmidt - Journal of Systems and Software, 2009 - Elsevier
Feature modeling is a common method used to capture the variability in a configurable
application. A key challenge developers face when using a feature model is determining …
application. A key challenge developers face when using a feature model is determining …
A new class of hard problem instances for the 0–1 knapsack problem
The 0–1 knapsack problem is an important optimization problem, because it arises as a
special case of a wide variety of optimization problems and has been generalized in several …
special case of a wide variety of optimization problems and has been generalized in several …
Approximating multiobjective knapsack problems
For multiobjective optimization problems, it is meaningful to compute a set of solutions
covering all possible trade-offs between the different objectives. The multiobjective …
covering all possible trade-offs between the different objectives. The multiobjective …
[HTML][HTML] An efficient fully polynomial approximation scheme for the subset-sum problem
Given a set of n positive integers and a knapsack of capacity c, the Subset-Sum Problem is
to find a subset the sum of which is closest to c without exceeding the value c. In this paper …
to find a subset the sum of which is closest to c without exceeding the value c. In this paper …