Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Mestre, Julian"'
Function layout, also referred to as function reordering or function placement, is one of the most effective profile-guided compiler optimizations. By reordering functions in a binary, compilers are able to greatly improve the performance of large-sc
Externí odkaz:
http://arxiv.org/abs/2211.09285
Modern compilers leverage block coverage profile data to carry out downstream profile-guided optimizations to improve the runtime performance and the size of a binary. Given a control-flow graph $G=(V, E)$ of a function in the binary, where nodes in
Externí odkaz:
http://arxiv.org/abs/2208.13907
Autor:
Cao, Nairen, Fineman, Jeremy T., Li, Shi, Mestre, Julián, Russell, Katina, Umboh, Seeun William
The active-time scheduling problem considers the problem of scheduling preemptible jobs with windows (release times and deadlines) on a parallel machine that can schedule up to $g$ jobs during each timestep. The goal in the active-time problem is to
Externí odkaz:
http://arxiv.org/abs/2207.12507
We initiate the theoretical study of Ext-TSP, a problem that originates in the area of profile-guided binary optimization. Given a graph $G=(V, E)$ with positive edge weights $w: E \rightarrow R^+$, and a non-increasing discount function $f(\cdot)$ s
Externí odkaz:
http://arxiv.org/abs/2107.07815
Autor:
Makhijani, Rahul, Shah, Parikshit, Avadhanula, Vashist, Gocmen, Caner, Stier-Moses, Nicolás E., Mestre, Julián
Moderating content in social media platforms is a formidable challenge due to the unprecedented scale of such systems, which typically handle billions of posts per day. Some of the largest platforms such as Facebook blend machine learning with manual
Externí odkaz:
http://arxiv.org/abs/2103.16816
The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are $k$ types of nodes on one side (the ads), and an ordered set of nodes on the other side (the slots). The edge weight of an ad $i$ of type $\theta$
Externí odkaz:
http://arxiv.org/abs/1907.04400
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the total movement
Externí odkaz:
http://arxiv.org/abs/1709.10285
We consider the following single-machine scheduling problem, which is often denoted $1||\sum f_{j}$: we are given $n$ jobs to be scheduled on a single machine, where each job $j$ has an integral processing time $p_j$, and there is a nondecreasing, no
Externí odkaz:
http://arxiv.org/abs/1612.03339
Publikováno v:
In Discrete Applied Mathematics 31 December 2021 305:199-204
