Search
Search Results
-
A Novel CFLRU-Based Cache Management Approach for NAND-Based SSDs
To ensure better I/O performance of NAND-based SSD storage, a DRAM cache is commonly equipped inside SSDs to absorb overwrites or writes performed to...
-
dgQuEST: Accelerating Large Scale Quantum Circuit Simulation through Hybrid CPU-GPU Memory Hierarchies
With the advancement of quantum computing, verifying the correctness of the quantum circuits becomes critical while develo** new quantum...
-
An Outer-Approximation Algorithm for Maximum-Entropy Sampling
We apply the well-known MINLO outer-approximation algorithm (OA) to the maximum-entropy sampling problem (MESP), using the linx and NLP convex...
-
Optimal Vaccination Strategies for Multiple Dose Vaccinations
Due to the COVID-19 pandemic and the shortage of vaccinations during its roll-out, the question regarding the best strategy to achieve immunity in...
-
Improved Bounds for Stochastic Extensible Bin Packing Under Distributional Assumptions
In the stochastic extensible bin packing problem, n items of random size must be packed into m bins of unit capacity. The number of bins is fixed,...
-
Piecewise Linearization of Bivariate Nonlinear Functions: Minimizing the Number of Pieces Under a Bounded Approximation Error
This work focuses on the approximation of bivariate functions into piecewise linear ones with a minimal number of pieces and under a bounded...
-
Unified Greedy Approximability Beyond Submodular Maximization
We consider classes of objective functions of cardinality-constrained maximization problems for which the greedy algorithm guarantees a constant...
-
Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization
We address detrimental anomalies in parallel versions of two state-of-the-art algorithms for convex mixed-integer nonlinear programs (MINLPs):...
-
High Multiplicity Strip Packing with Three Rectangle Types
The two-dimensional strip packing problem consists of packing in a rectangular strip of width 1 and minimum height a set of n rectangles, where each...
-
On the Thinness of Trees
The study of structural graph width parameters like tree-width, clique-width and rank-width has been ongoing during the last five decades, and their...
-
Pervasive Domination
Inspired by the implicit or explicit persuasion scenario, which characterizes social media platforms, we analyze a novel domination problem named...
-
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms
Cameron et al. [27th Int. Conf. Computing and Combinatorics (COCOON 2021), LNCS 13025, pp. 49–60] recently presented an algorithm for generating all...
-
TOPS: Transition-Based Volatility-Reduced Policy Search
Existing risk-averse reinforcement learning approaches still face several challenges, including the lack of global optimality guarantee and the...
-
About Digital Twins, Agents, and Multiagent Systems: A Cross-Fertilisation Journey
Digital Twins (DTs) are emerging as a fundamental brick of engineering cyber-physical systems, but their notion is still mostly bound to specific...
-
Purposeful Failures as a Form of Culturally-Appropriate Intelligent Disobedience During Human-Robot Social Interaction
Human-robot interaction (HRI) can suffer from breakdowns that are often regarded as “failures” by roboticists. Here, however, we argue that such...
-
Distance from Triviality 2.0: Hybrid Parameterizations
Vertex deletion problems have been at the heart of numerous major advances in Algorithms and Combinatorial Optimization, and especially so in the...
-
1-Extendability of Independent Sets
In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set....
-
Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening
Combinatorial group testing (CGT) is used to identify defective items from a set of items by grou** them together and performing a small number of...
-
On the Intractability Landscape of Digraph Intersection Representations
We study the classical graph intersection number problem [Erdős et al., CJM1966] for directed acyclic graphs as recently proposed in [Kostochka et...
-
An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillars
In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected graphs the problem is to determine an...