Publication

Probabilistic exchange algorithm and Euclidean traveling: Salesman problems

Related publications (35)

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.

Dense Depth Estimation from Omnidirectional Images

Pascal Frossard, Zafer Arican

This paper addresses the problem of dense disparity estimation in networks of omnidirectional cameras. We propose to map omnidirectional images on the 2-sphere, and we perform disparity estimation directly on the sphere in order to preserve the geometry of ...

2009

Modifier-Adaptation Methodology for Real-Time Optimization

Dominique Bonvin, Alejandro Gabriel Marchetti

The ability of a model-based real-time optimization scheme to converge to the plant optimum relies on the ability of the underlying process model to predict the plant's necessary conditions of optimality (NCO). These include the values and gradients of the ...

2009

Modifier-adaptation methodology for real-time optimization

Alejandro Gabriel Marchetti

The process industries are characterized by a large number of continuously operating plants, for which optimal operation is of economic importance. However, optimal operation is particularly difficult to achieve when the process model used in the optimizat ...

EPFL2009

Local search techniques for multi-agent constraint optimization problems

Quang Huy Nguyen

Combinatorial optimization problems in the real world are ubiquitous. Practical applications include planning, scheduling, distributed control, resource allocation, etc. These problems often involve multiple agents and can be formulated as a Multi-agent Co ...

EPFL2008

Adaptive and robust media streaming over multiple channels with bursty losses

Pascal Frossard, Jean-Paul Wagner

This paper addresses the problem of efficiently delivering a layered media stream from multiple senders to a single receiver, over channels that present correlated packet loss patterns. Using a digital fountain approach, the performance of a distributed st ...

2007

Algorithms for longer OLED lifetime

Friedrich Eisenbrand

We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing through the diodes which has a direct impact on the lifetime of such a display. The opt ...

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

Optimal Solution Stability in Real Time Optimization

Boi Faltings, Adrian Petcu

We define the distributed, real-time combinatorial optimization problem. We propose a general, semantically well-defined notion of solution stability in such systems, based on the cost of change from an already implemented solution to the new one. This app ...

2005

A Scalable Method for Multiagent Constraint Optimization

Boi Faltings, Adrian Petcu

We present in this paper a new complete method for distributed constraint optimization. This is a utility-propagation method, inspired by the sum-product algorithm (Kschischang et al 2001). The original algorithm requires fixed message sizes, linear memory ...

2005

Trust-region methods based on radial basis functions with application to biomedical imaging

Rodrigue Oeuvray

We have developed a new derivative-free algorithm based on Radial Basis Functions (RBFs). Derivative-free optimization is an active field of research and several algorithms have been proposed recently. Problems of this nature in the industrial setting are ...

EPFL2005