Concept

Constraint satisfaction

Related publications (223)

Heuristic algorithms for minimising total recovery cost of end-of-life products under quality constraints

Recently, the optimisation of end-of-life (EOL) product recovery processes has been highlighted. At the inspection phase after disassembly, each part can have various recovery options such as reuse, reconditioning, remanufacturing, and disposal. Depending ...

Taylor & Francis Ltd2012

Strabon: A Semantic Geospatial DBMS

Manolis Karpathiotakis

We present Strabon, a new RDF store that supports the state of the art semantic geospatial query languages stSPARQL and GeoSPARQL. To illustrate the expressive power offered by these query languages and their implementation in Strabon, we concentrate on th ...

Springer Berlin Heidelberg2012

On an Efficient Decision Procedure for Imperative Tree Data Structures

Viktor Kuncak

We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invari ...

2011

Multi-objective optimization of regenerator placement using Constraint Programming

Sébastien Rumley, Christian Gaumier

In translucent optical networks, connections bypass most intermediate nodes transparently. However, their signal quality is affected by the traveled distance and/or the bypass operations. Hence, they might require optical-electrical-optical conversions at ...

2011

MDD propagators with explanation

Radoslaw Szymanek

Multi-valued decision diagrams (MDDs) are a convenient approach to representing many kinds of constraints including table constraints, regular constraints, complex set and multiset constraints, as well as ad-hoc problem specific constraints. This paper int ...

2011

Input Filter Design for Feasibility in Constraint-Adaptation Schemes

Dominique Bonvin, Grégory François, Gene Bunin

The subject of real-time, steady-state optimization under significant uncertainty is addressed in this paper. Specifically, the use of constraint-adaptation schemes is reviewed, and it is shown that, in general, such schemes cannot guarantee process feasib ...

2011

Long Term Real Trajectory Reuse Through Region Goal Satisfaction

Daniel Thalmann, Pascal Fua, Ronan Boulic, Stéphane Gobron, Junghyun Ahn, Horesh Beny Ben Shitrit, Mirko Raca, Quentin Silvestre

This paper is motivated by the objective of improving the realism of real-time simulated crowds by reducing short term collision avoidance through long term anticipation of pedestrian trajectories. For this aim, we choose to reuse outdoor pedestrian trajec ...

Springer Berlin Heidelberg2011

NxN Coupling Matrix Synthesis of Dissipative Microwave Filters

Michael Mattes, Francisco Edén Sorolla Rosario, Diego Navarro Tapia

In this communication, the coupling matrix synthesis of dissipative microwave filters is analyzed and compared to the synthesis of lossless filters. A modified definition of the vector matrix product allows using the same synthesis procedure in both cases. ...

2011

On Sums of Locally Testable Affine Invariant Properties

Ghid Maatouk, Elena Grigorescu

Affine-invariant properties are an abstract class of properties that generalize some central algebraic ones, such as linearity and low-degree-ness, that have been studied extensively in the context of property testing. Affine invariant properties consider ...

Springer2011

A column generation algorithm for the vehicle routing problem with soft time windows

Matteo Salani

The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set of routes for a fleet of vehicles of limited capacity visiting a given set of customers with known demand, with the additional constraint that each customer must be visi ...

2011

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.