Publications associées à Freight railway network design problem

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In-Network View Synthesis for Interactive Multiview Video Systems

Pascal Frossard, Laura Toni

In multiview applications, camera views can be used as reference views to synthesize additional virtual viewpoints, allowing users to freely navigate within a 3D scene. However, bandwidth constraints may restrict the number of reference views sent to clien ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Network design of a transport system based on accelerating moving walkways

Michel Bierlaire, Riccardo Scarinci, Iliya Dimitrov Markov

Pollution, congestion and urbanistic considerations are leading to a change in the use of private vehicles in dense city centers. More frequently, the last-mile is covered with systems such as public transport, car sharing and bike sharing as well as an in ...

2016

Inventory routing with non-stationary stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We solve a rich logistical problem inspired from practice, in which a heterogeneous fixed fleet of vehicles is used for collecting recyclable waste from large containers over a finite planning horizon. Each container is equipped with a sensor, which commun ...

2016

Comparing genomes with rearrangements and segmental duplications

Bernard Moret, Mingfu Shao

Motivation: Large-scale evolutionary events such as genomic rearrange. ments and segmental duplications form an important part of the evolution of genomes and are widely studied from both biological and computational perspectives. A basic computational pro ...

Oxford University Press2015

Improving Christofides' Algorithm for the s-t Path TSP

Hyung Chan An

We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...

Assoc Computing Machinery2015

Prioritized Random MAC Optimization via Graph-based Analysis

Pascal Frossard, Laura Toni

Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access control protoco ...

Institute of Electrical and Electronics Engineers2015

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

Daniel Kuhn, Wolfram Wiesemann

Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that, primal and dual linear decision rule approximations can ...

Springer Verlag2015

On Computing Task-Oriented Grasps

Aude Billard, Sahar El Khoury, Ravin Luis De Souza

This paper addresses the problem of optimal grasping of an object with a multi-fingered robotic hand for accomplishing a given task. The task is first demonstrated by a human operator and its force/torque requirements are captured through the usage of a se ...

Elsevier Science Bv2015

Probabilistic multimodal map-matching with rich smartphone data

Michel Bierlaire, Jingmin Chen

This article proposes a probabilistic method that infers the transport modes and the physical paths of trips from smartphone data that were recorded during travels. This method synthesizes multiple kinds of data from smartphone sensors, which provide relev ...

Taylor & Francis Inc2015

Freight railway network design problem

Graph Chatbot

Chattez avec Graph Search

In-Network View Synthesis for Interactive Multiview Video Systems

Network design of a transport system based on accelerating moving walkways

Inventory routing with non-stationary stochastic demands

Comparing genomes with rearrangements and segmental duplications

Enforcing Efficient Equilibria in Network Design Games via Subsidies

Improving Christofides' Algorithm for the s-t Path TSP

Prioritized Random MAC Optimization via Graph-based Analysis

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

On Computing Task-Oriented Grasps

Probabilistic multimodal map-matching with rich smartphone data

In-Network View Synthesis for Interactive Multiview Video Systems

Improving Christofides' Algorithm for the s-t Path TSP

Enforcing Efficient Equilibria in Network Design Games via Subsidies

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

Comparing genomes with rearrangements and segmental duplications

Prioritized Random MAC Optimization via Graph-based Analysis

Inventory routing with non-stationary stochastic demands

Network design of a transport system based on accelerating moving walkways

On Computing Task-Oriented Grasps

Probabilistic multimodal map-matching with rich smartphone data