Publication

Optimal Algorithms for Page Migration in Dynamic Networks

Related publications (33)

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.

A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

Michel Bierlaire, Tomas Robenek, Nitish Umang

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem ...

2012

Container Terminal Management

Ilaria Vacca

This thesis deals with models and methods for large scale optimization problems; in particular, we focus on decision problems arising in the context of seaport container terminals for the efficient management of terminal operations. Large-scale optimizatio ...

EPFL2011

A novel optimization approach for minimum cost design of trusses

Abhinav Gupta

This paper describes new optimization strategies that offer significant improvements in performance over existing methods for bridge-truss design. In this study, a real-world cost function that consists of costs on the weight of the truss and the number of ...

2007

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...

2006

Nearly optimal exploration-exploitation decision thresholds

Christos Dimitrakakis

While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds for the multi-armed bandit problem, one for the infinite horizon discounted ...

2006

Nearly optimal exploration-exploitation decision thresholds

Christos Dimitrakakis

IDIAP2006

Nearly optimal exploration-exploitation decision thresholds

Christos Dimitrakakis

2006

Tree-Based Pursuit: Algorithm and Properties

Pascal Frossard, Pierre Vandergheynst, Philippe Jost

This paper proposes a tree-based pursuit algorithm that efficiently trades off complexity and approximation performance for overcomplete signal expansions. Finding the sparsest representation of a signal using a redundant dictionary is, in general, a NP-Ha ...

2006

Tree-Based Pursuit: Algorithm and Properties

Pascal Frossard, Pierre Vandergheynst, Philippe Jost

2005

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005