Publication

Interchangeability with thresholds and degradation factors for Soft CSPs

Related publications (37)

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.

Solving singularity issues in the estimation of econometric models

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans

Econometric models play an important role in transportation analysis. Estimating more and more complex models becomes problematic. The associated log-likelihood function is highly nonlinear and non concave and the comlexity of the model requires constraint ...

2006

Solving issues in the estimation of econometric models

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans

STRC 20062006

Rigorous solution techniques for numerical constraint satisfaction problems

Xuan-Ha Vu

A constraint satisfaction problem (e.g., a system of equations and inequalities) consists of a finite set of constraints specifying which value combinations from given variable domains are admitted. It is called numerical if its variable domains are contin ...

EPFL2005

Distributed Generator Maintenance Scheduling

Boi Faltings, Adrian Petcu

In recent years the electricity sector has undergone a number of changes that all point in the direction of liberalization and decentralization of control. However, a number of technological challenges have to be addressed before the desired degree of dece ...

2005

Decision-aid methodology for the school bus routing and scheduling problem

Michel Bierlaire, Thomas Liebling

We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...

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

Distortion Optimized Multipath Video Streaming

Pascal Frossard, Dan Jurca

This paper addresses the problem of choosing the best streaming policy for distortion optimal multipath video delivery, under delay constraints. The streaming policy consists in a joint selection of the video packets to be transmitted, as well as their sen ...

2004

A Value Ordering Heuristic for Local Search in Distributed Resource Allocation

Boi Faltings, Adrian Petcu

In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achieve desirable properties (increased effectiveness, or better allocations). The specifi ...

2004

A Distributed, Complete Method for Multi-Agent 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. The original algorithm requires fixed message sizes, linear memory, and is time-linear in t ...

2004

Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems

Boi Faltings, Carlos Eisenberg

Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unsolvability and is thus not suitable for highly constrained or overconstrained ...

Swiss Federal Institute of Technology (EPFL)2003