Zobrazeno 1 - 10
of 315
pro vyhledávání: '"Angel, Eric"'
In this paper we study a scheduling problem arising from executing numerical simulations on HPC architectures. With a constant number of parallel machines, the objective is to minimize the makespan under memory constraints for the machines. Those con
Externí odkaz:
http://arxiv.org/abs/2202.08704
Autor:
Issa, Tina1 (AUTHOR), Angel, Eric1 (AUTHOR), Zehraoui, Farida1 (AUTHOR) farida.zehraoui@univ-evry.fr
Publikováno v:
PLoS ONE. 7/18/2024, Vol. 19 Issue 7, p1-22. 22p.
Publikováno v:
In European Journal of Operational Research September 2024
Autor:
Angel, Eric, Bampis, Evripidis
We consider the Maximum Vectors problem in a strategic setting. In the classical setting this problem consists, given a set of $k$-dimensional vectors, in computing the set of all nondominated vectors. Recall that a vector $v=(v^1, v^2, \ldots, v^k)$
Externí odkaz:
http://arxiv.org/abs/1903.09843
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 20 no. 2, Discrete Algorithms (October 8, 2018) dmtcs:4256
We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand. A solution is an assignment of (power) values t
Externí odkaz:
http://arxiv.org/abs/1801.10476
In this paper, we study the $k$-forest problem in the model of resource augmentation. In the $k$-forest problem, given an edge-weighted graph $G(V,E)$, a parameter $k$, and a set of $m$ demand pairs $\subseteq V \times V$, the objective is to constru
Externí odkaz:
http://arxiv.org/abs/1611.07489
Autor:
Bennett, Nathan J., Ban, Natalie C., Schuhbauer, Anna, Splichalova, Dacotah-Victoria, Eadie, Megan, Vandeborne, Kiera, McIsaac, Jim, Angel, Eric, Charleson, Joshua, Gavenus, Erika R., Harper, Sarah, Satterfield, Terre, Sutcliffe, Tasha, Sumaila, Rashid
Publikováno v:
In Marine Policy August 2021 130
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 need to be often calibrated. Given that calibration costs, it is importa
Externí odkaz:
http://arxiv.org/abs/1507.02808
We are given a set of $n$ jobs that have to be executed on a set of $m$ speed-scalable machines that can vary their speeds dynamically using the energy model introduced in [Yao et al., FOCS'95]. Every job $j$ is characterized by its release date $r_j
Externí odkaz:
http://arxiv.org/abs/1402.3782
We are given a set of $n$ jobs and a single processor that can vary its speed dynamically. Each job $J_j$ is characterized by its processing requirement (work) $p_j$, its release date $r_j$ and its deadline $d_j$. We are also given a budget of energy
Externí odkaz:
http://arxiv.org/abs/1309.1732