Concept

Programmation dynamique

Publications associées (204)

Dynamic urban origin-destination matrix estimation methodology

The aim of this thesis is to develop a new methodology to determine dynamic Origin-Destination (OD) matrices for urban networks characterized by a high number of traffic hubs, complex route choice possibilities and a high level of traffic controls. By revi ...

EPFL2009

Semi-Supervised Segmentation based on Non-local Continuous Min-Cut

Jean-Philippe Thiran, Xavier Bresson, Nawal Houhou

We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentation process is performed via energy minimization. The proposed energy is comp ...

Springer2009

New dynamic programming algorithms for the resource constrained shortest path problem.

Matteo Salani

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...

2008

Multi-Camera People Tracking with a Probabilistic Occupancy Map

Pascal Fua, François Fleuret, Jérôme Berclaz

Given two to four synchronized video streams taken at eye level and from different angles, we show that we can effectively combine a generative model with dynamic programming to accurately follow up to six individuals across thousands of frames in spite of ...

Institute of Electrical and Electronics Engineers2008

NCO Tracking for Singular Control Problems Using Neighboring Extremals

Dominique Bonvin, Benoît Chachuat, Sébastien Gros

A powerful approach for dynamic optimization in the presence of uncertainty is to incorporate measurements into the optimization framework so as to track the necessary conditions of optimality (NCO), the so-called NCO- tracking approach. For nonsingular co ...

2008

Efficient Data Structures for Decision Diagrams

Nacereddine Ouaret

Dynamic Programming OPtimization (DPOP) is an algorithm proposed for solving distributed constraint optimization problems. In this algorithm, Hypercubes are used as the format of the messages exchanged between the agents. Then, Hybrid-DPOP (H-DPOP), a hybr ...

2008

Disseminating Streaming Data in a Dynamic Environment: an Adaptive and Cost-Based Approach

In a distributed stream processing system, streaming data are continuously disseminated from the sources to the distributed processing servers. To enhance the dissemination efficiency, these servers are typically organized into one or more dissemination tr ...

Springer-Verlag2008

Study of Tricyclic Cascade Networks using Dynamic Optimization

Dominique Bonvin, Vassily Hatzimanikatis, Benoît Chachuat, Andrijana Radivojevic

The mitogen-activated protein kinase (MAPK) cascades are ubiquitous in eukaryotic signal transduction, and these pathways are conserved in cells from yeast to mammals. They relay extracellular stimuli from the plasma membrane to targets in the cytoplasm an ...

2008

Aggregation and discretization in multistage stochastic programming

Daniel Kuhn

Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to ensure computational tractability, continuous-state stochastic programs are us ...

2008

Bound-based decision rules in multistage stochastic programming

Daniel Kuhn

We study bounding approximations for a multistage stochastic program with expected value constraints. Two simpler approximate stochastic programs, which provide upper and lower bounds on the original problem, are obtained by replacing the original stochast ...

2008

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search