In complex systems design, multidisciplinary constraints are imposed by stakeholders.
Engineers need to search feasible design space for a given problem before searching for …

Abstract Solutions to valid Quantified Constraint Satisfaction Problems (QCSPs) are called
winning strategies and represent possible ways in which the existential player can react to …

Abstract The Quantified Constraint Satisfaction Problem (QCSP) extends classical CSP in a
way which allows reasoning about uncertainty. In this paper I present novel algorithms for …

Bilevel optimization problems involve two decision makers who make their choices
sequentially, either one according to its own objective function. Many problems arising in …

Solving a quantified constraint satisfaction problem (QCSP) is usually a hard task due to its
computational complexity. Exact algorithms play an important role in solving this problem …

Interval is an alternative to probability distribution in quantifying uncertainty for sensitivity
analysis (SA) when there is a lack of data to fit a distribution with good confidence. It only …

Forschungsfrage Herr Wolf hat als Kern seiner Forschung quantifizierte lineare Programme
(QLPs), die erst seit ca. 10 Jahren im Forschungsfokus stehen. Der Begriff QLP wurde im …

Finding optimal schedules for the most commonly considered classes of scheduling
problems is NP-complete. Best algorithms scale up to very large scheduling problems when …

We study the complexity of the quantified and valued extension of the constraint satisfaction
problem (QVCSP) for certain classes of languages. This problem is also known as the …

Cette thèse s' inscrit dans le cadre de la programmation par contraintes quantifiées, un
formalisme étendantla programmation par contraintes classique en ajoutant aux variables …