Zobrazeno 1 - 10
of 233
pro vyhledávání: '"Ben Ameur, Walid"'
We investigate a cops and robber game on directed graphs, where the robber moves along the arcs of the graph, while the cops can select any position at each time step. Our main focus is on the cop number: the minimum number of cops required to guaran
Externí odkaz:
http://arxiv.org/abs/2410.04897
Publikováno v:
In Discrete Applied Mathematics 15 September 2024 354:94-107
Given the dynamic nature of traffic, we investigate the variant of robust network design where we have to determine the capacity to reserve on each link so that each demand vector belonging to a polyhedral set can be routed. The objective is either t
Externí odkaz:
http://arxiv.org/abs/2009.12291
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.
Autor:
Dhamal, Swapnil1 (AUTHOR) swapnil.dhamal@gmail.com, Ben-Ameur, Walid1 (AUTHOR), Chahed, Tijani1 (AUTHOR), Altman, Eitan2,3 (AUTHOR), Sunny, Albert4 (AUTHOR), Poojary, Sudheer5 (AUTHOR)
Publikováno v:
Annals of Operations Research. May2024, Vol. 336 Issue 3, p1871-1904. 34p.
We propose a setting for two-phase opinion dynamics in social networks, where a node's final opinion in the first phase acts as its initial biased opinion in the second phase. In this setting, we study the problem of two camps aiming to maximize adop
Externí odkaz:
http://arxiv.org/abs/1811.08291
Autor:
Dhamal, Swapnil, Ben-Ameur, Walid, Chahed, Tijani, Altman, Eitan, Sunny, Albert, Poojary, Sudheer
We study a stochastic game framework with dynamic set of players, for modeling and analyzing their computational investment strategies in distributed computing. Players obtain a certain reward for solving the problem or for providing their computatio
Externí odkaz:
http://arxiv.org/abs/1809.03143
One of the challenges of cloud computing is to optimally and efficiently assign virtual ma- chines to physical machines. The aim of telecommunication operators is to minimize the map- ping cost while respecting constraints regarding location, assignm
Externí odkaz:
http://arxiv.org/abs/1806.08871
We study the problem of optimally investing in nodes of a social network in a competitive setting, where two camps aim to maximize adoption of their opinions by the population. In particular, we consider the possibility of campaigning in multiple pha
Externí odkaz:
http://arxiv.org/abs/1804.06081
Autor:
Dhamal, Swapnil, Ben-Ameur, Walid, Chahed, Tijani, Altman, Eitan, Sunny, Albert, Poojary, Sudheer
Publikováno v:
In Journal of Parallel and Distributed Computing November 2022 169:317-333