Related publications (100)

Further Collapses in TFNP

Mika Tapani Göös, Gilbert Théodore Maystre, Alexandros Paul Hollender, Siddhartha Jain, Ran Tao

We show EOPL = PLS \cap PsansP \sansP AD. Here the class EOPL consists of all total search problems that reduce to the END -OF -POTENTIAL -LINE problem, which was introduced in the works by Hub'acv \ek and Yogev (SICOMP 2020) and Fearnley et al. (JCSS 202 ...
Siam Publications2024

Modelling and solving a real-world truck-trailer scheduling problem in container transportation with separate moving objects

Thanh Trung Huynh, Van Son Nguyen

Container transportation is pivotal in global supply chains, facilitating the exchange of goods between companies across different countries. Given the exceedingly high operational costs of transporting containers, optimizing itinerary schedules can yield ...
New Delhi2024

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets

Daniel Kuhn, Mengmeng Li, Tobias Sutter

We propose a policy gradient algorithm for robust infinite-horizon Markov Decision Processes (MDPs) with non-rectangular uncertainty sets, thereby addressing an open challenge in the robust MDP literature. Indeed, uncertainty sets that display statistical ...
2023

A continuum approximation approach to the depot location problem in a crowd-shipping system

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...
PERGAMON-ELSEVIER SCIENCE LTD2023

Design Space Exploration for Partitioning Dataflow Program on CPU-GPU Heterogeneous System

Marco Mattavelli, Simone Casale Brunet, Aurélien François Gilbert Bloch

Dataflow programming is a methodology that enables the development of high-level, parametric programs that are independent of the underlying platform. This approach is particularly useful for heterogeneous platforms, as it eliminates the need to rewrite ap ...
SPRINGER2023

Further Collapses in TFNP

Mika Tapani Göös, Gilbert Théodore Maystre, Alexandros Paul Hollender, Siddhartha Jain, Ran Tao

We show EOPL = PLS ∩ PPAD. Here the class EOPL consists of all total search problems that reduce to the End-of-Potential-Line problem, which was introduced in the works by Hubáček and Yogev (SICOMP 2020) and Fearnley et al. (JCSS 2020). In particular, our ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Large-scale traffic signal control and multimodal network design

Dimitrios Tsitsokas

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...
EPFL2022

Dual-function engineering to construct ultra-stable anodes for potassium-ion hybrid capacitors: N, O-doped porous carbon spheres

Yanan Chen, Kangning Zhao, Chao Yang, Jie Xu, Xin Peng, Wen Liu, Wei Zhou

Heteroatom doping engineering is deemed to be an adoptable strategy to boost the potassium (K) storage performance of carbonaceous materials. The inevitable issue for this strategy lies in the huge volume expansion originated from the large radius of K+. I ...
ELSEVIER2022

Controlling pedestrian flows with moving walkways

Michel Bierlaire, Nicholas Alan Molyneaux

Moving walkways are pedestrian dedicated hardware which generally decrease pedestrian travel time. We propose the utilization of these devices to dynamically control pedestrian flows in order to improve pedestrian dynamics. Three variations of a control st ...
PERGAMON-ELSEVIER SCIENCE LTD2022

Proofs, Circuits, and Communication

Mika Tapani Göös

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...
2022

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.