Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Paul, Alice"'
In shared micromobility networks, such as bike-share and scooter-share networks, using trip data to accurately estimate demand in docked and dockless systems is critical to analyzing how the system is operating, such as identifying the number of diss
Externí odkaz:
http://arxiv.org/abs/2303.09971
Autor:
Paul, Alice, Martonosi, Susan
Traditional network interdiction problems focus on removing vertices or edges from a network so as to disconnect or lengthen paths in the network; network diversion problems seek to remove vertices or edges to reroute flow through a designated critic
Externí odkaz:
http://arxiv.org/abs/2302.01227
Publikováno v:
Journal of Machine Learning Research 23 (2002)
We introduce a novel method for clustering using a semidefinite programming (SDP) relaxation of the Max k-Cut problem. The approach is based on a new methodology for rounding the solution of an SDP relaxation using iterated linear optimization. We sh
Externí odkaz:
http://arxiv.org/abs/2012.09202
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular, we consid
Externí odkaz:
http://arxiv.org/abs/2012.02213
Autor:
Paul, Alice, Williamson, David P.
In this note, we consider the capacitated facility location problem when the transportation costs of the instance satisfy the Monge property. We show that a straightforward dynamic program finds the optimal solution when the demands are polynomially
Externí odkaz:
http://arxiv.org/abs/2001.02727
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:
Becker, Amariah, Paul, Alice
We develop a general framework for designing polynomial-time approximation schemes (PTASs) for various vehicle routing problems in trees. In these problems, the goal is to optimally route a fleet of vehicles, originating at a depot, to serve a set of
Externí odkaz:
http://arxiv.org/abs/1807.04308
Autor:
Adam, Gaelen P, DeYoung, Jay, Paul, Alice, Saldanha, Ian J, Balk, Ethan M, Trikalinos, Thomas A, Wallace, Byron C
Publikováno v:
JAMIA Open; Oct2024, Vol. 7 Issue 3, p1-11, 11p
Autor:
Paul, Alice, Pippenger, Nicholas
We consider regular tessellations of the plane as infinite graphs in which $q$ edges and $q$ faces meet at each vertex, and in which $p$ edges and $p$ vertices surround each face. For $1/p + 1/q = 1/2$, these are tilings of the Euclidean plane; for $
Externí odkaz:
http://arxiv.org/abs/1006.4356