Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Lior Aronshtam"'
Publikováno v:
Future Transportation, Vol 4, Iss 1, Pp 1-14 (2023)
Delivery systems are ubiquitous in today’s economy. However, those systems usually operate through purpose-built vehicles, which are inefficient, expensive, and highly harmful to the environment. We propose an optimal route crowd-shipping (OR-CS) s
Externí odkaz:
https://doaj.org/article/61287c24bbc44ef7b31c0e99f7f31b84
Publikováno v:
Annals of Operations Research. 321:39-48
Autor:
Hagai Ilani, Lior Aronshtam
Publikováno v:
Discrete Applied Mathematics. 306:114-119
Publikováno v:
Education and Information Technologies. 26:5851-5872
Improving code while preserving its functionality is a common task in the hi-tech industry. Yet students have difficulties improving an algorithm’s run-time complexity by an order of magnitude. The paper focuses on assessing students’ abilities i
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 86:257-268
Is it possible for the organizers of a sports tournament to influence the identity of the final winner by manipulating the initial seeding of the tournament? Is it possible to ensure a specific good (i.e. king) player will win at least a certain numb
Publikováno v:
Journal of Computational Methods in Sciences and Engineering. 18:931-938
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 80:153-169
This article focuses on the question of whether a certain candidate’s (player’s) chance to advance further in a tennis tournament can be increased when the ordering of the tournament can be controlled (manipulated by the organizers) according to
Autor:
Nathan Linial, Lior Aronshtam
Publikováno v:
Random Structures & Algorithms. 48:260-269
In this paper we determine the threshold for d-collapsibility in the probabilistic model Xdn,p of d-dimensional simplicial complexes. A lower bound for this threshold p=i¾?dn was established in Aronshtam and Linial, Random Struct. Algorithms 46 2015
Autor:
Nathan Linial, Lior Aronshtam
Several years ago Linial and Meshulam (Combinatorica 26 (2006) 457–487) introduced a model called of random n-vertex d-dimensional simplicial complexes. The following question suggests itself very naturally: What is the threshold probability at whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f91ecdefc617af7eb8ce26a4d5ea963
Publikováno v:
Discrete & Computational Geometry
Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit constant gamm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf19b3e9216ce166b5a462ba8c0b5b08
http://arxiv.org/abs/1010.1400
http://arxiv.org/abs/1010.1400