1 citations · 3 across the 6 of their papers we have counts for
8 papers
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis +4
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to…
AoI-Constrained Bandit: Information Gathering over Unreliable Channels with Age Guarantees
Ziyao Huang, Weiwei Wu, Chenchen Fu +4
Age-of-Information (AoI) is an application layer metric that has been widely adopted to quantify the information freshness of each information source. However, few works address th…
Too Much Information Kills Information: A Clustering Perspective
Yicheng Xu, Vincent Chau, Chenchen Wu +3
Clustering is one of the most fundamental tools in the artificial intelligence area, particularly in the pattern recognition and learning theory. In this paper, we propose a simple…
Online Joint Placement and Allocation of Virtual Network Functions with Heterogeneous Servers
Yicheng Xu, Vincent Chau, Chenchen Wu +2
Network Function Virtualization (NFV) is a promising virtualization technology that has the potential to significantly reduce the expenses and improve the service agility. NFV make…
Calibrations Scheduling Problem with Arbitrary Lengths and Activation Length
Eric Angel, Evripidis Bampis, Vincent Chau +1
Bender et al. (SPAA 2013) have proposed a theoretical framework for testing in contexts where safety mistakes must be avoided. Testing in such a context is made by machines that ne…
Throughput Maximization in Multiprocessor Speed-Scaling
Eric Angel, Evripidis Bampis, Vincent Chau +1
We are given a set of jobs that have to be executed on a set of speed-scalable machines that can vary their speeds dynamically using the energy model introduced in [Yao et…
Energy Efficient Scheduling of MapReduce Jobs
Evripidis Bampis, Vincent Chau, Dimitrios Letsios +3
MapReduce is emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first int…
Throughput Maximization in the Speed-Scaling Setting
Eric Angel, Evripidis Bampis, Vincent Chau
We are given a set of jobs and a single processor that can vary its speed dynamically. Each job is characterized by its processing requirement (work) , its release d…