Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Walid Krichene"'
Autor:
Walid Krichene, Steffen Rendle
Publikováno v:
KDD
Recommender systems personalize content by recommending items to users. Item recommendation algorithms are evaluated by metrics that compare the positions of truly relevant items among the recommended items. To speed up the computation of metrics, re
Autor:
Steffen Rendle, Walid Krichene
Publikováno v:
IJCAI
Recommender systems personalize content by recommending items to users. Item recommendation algorithms are evaluated by metrics that compare the positions of truly relevant items among the recommended items. To speed up the computation of metrics, re
Publikováno v:
RecSys
Embedding based models have been the state of the art in collaborative filtering for over a decade. Traditionally, the dot product or higher order equivalents have been used to combine two or more embeddings, e.g., most notably in matrix factorizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bc7d0dae350a8268dc4eb22b729f741
Publikováno v:
IEEE Transactions on Control of Network Systems. 5:479-488
We consider a repeated routing game over a finite horizon with partial control under selfish response, in which a central authority can control a fraction of the flow and seeks to improve a network-wide objective, while the remaining flow applies an
Autor:
Maria Laura Delle Monache, Paola Goatin, Jack Reilly, Walid Krichene, Alexandre M. Bayen, Samitha Samaranayake
Publikováno v:
Transportation Science
Transportation Science, INFORMS, 2018, 52 (4), pp.982-1001. ⟨10.1287/trsc.2017.0800⟩
Transportation Science, 2018, 52 (4), pp.982-1001. ⟨10.1287/trsc.2017.0800⟩
Transportation Science, INFORMS, 2018, 52 (4), pp.982-1001. ⟨10.1287/trsc.2017.0800⟩
Transportation Science, 2018, 52 (4), pp.982-1001. ⟨10.1287/trsc.2017.0800⟩
We consider the System Optimal Dynamic Traffic Assignment (SO-DTA) problem with Partial Control for general networks with physical queuing. Our goal is to optimally control any subset of the networks agents to minimize the total congestion of all age
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb0d9564b563bef58eb24678b47c0ccb
https://hal.inria.fr/hal-01095707/file/SO-DTAonline.pdf
https://hal.inria.fr/hal-01095707/file/SO-DTAonline.pdf
Publikováno v:
Handbook of Dynamic Game Theory ISBN: 9783319273358
Handbook of Dynamic Game Theory
Handbook of Dynamic Game Theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::217b19be304af7c8d91c2e74045a8e15
https://doi.org/10.1007/978-3-319-44374-4_26
https://doi.org/10.1007/978-3-319-44374-4_26
Autor:
Paola Goatin, Alexandre M. Bayen, Jack Reilly, Walid Krichene, Maria Laura Delle Monache, Samitha Samaranayake
Publikováno v:
Journal of Optimization Theory and Applications. 167:733-760
The adjoint method provides a computationally efficient means of calculating the gradient for applications in constrained optimization. In this article, we consider a network of scalar conservation laws with general topology, whose behavior is modifi
Publikováno v:
SIAM Journal on Control and Optimization. 53:1056-1081
We study the repeated, nonatomic congestion game, in which multiple populations of players share resources and make, at each iteration, a decentralized decision on which resources to utilize. We investigate the following question: given a model of ho
Publikováno v:
IEEE Transactions on Automatic Control. 59:714-727
This paper presents a game theoretic framework for studying Stackelberg routing games on parallel networks with horizontal queues, such as transportation networks. First, we introduce a new class of latency functions that models congestion due to the
Publikováno v:
2016 ACM/IEEE 7th International Conference on Cyber-Physical Systems (ICCPS).