A Dynamic Constraint Satisfaction Problem (DCSP) is a sequence of static CSPs that are formed by constraint changes. In this sequence, the solution of one CSP may be invalidated by one or more constraint changes. To find a minimal change solution for that CSP with respect to the solution of the previous related CSP, a Repair-Based algorithm with Arc-Consistency (denoted as RB-AC in [4]) has bee...

We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, encompassing the top cycle, the uncovered set, the Banks set, the minimal covering set, and the tournament equilibrium set. Moreover, the hi...

One of the most celebrated problems in geometry and calculus of variations is the Bernstein problem, which asserts that a C2 minimal graph in R3 must necessarily be an affine plane. Following an old tradition, here minimal means of vanishing mean curvature. Bernstein [Be] established this property in 1915. Almost fifty years later a new insight of Fleming [Fle] sparked a major development in th...

is responsible for the progress of nonlinear elliptic PDE theory in the last century. Indeed, most early works on nonlinear elliptic problems focused on this particular equation. There are many beautiful existence, uniqueness, regularity theorems for the minimal surface equation, see for example [13]. The graph of a solution to (1.1) is naturally a minimal hypersurface in R. In general, we can ...

The problem of making the output insensitive to an exogenous input signal possibly known with preview is tackled in the geometric approach context. The definition of minimal preview for decoupling is introduced. Necessary and sufficient constructive conditions for decoupling with minimal preview are proved by means of simple geometric arguments. The structural and the stabilizability conditions...

The minimal positive solutions of the heat equation on A' X (-00, 7") are determined for X a homogeneous Riemannian space. A simple proof of uniqueness for the positive Cauchy problem on a homogeneous space is given using Choquet's theorem and the explicit form of these solutions. Introduction. A minimal solution of a linear elliptic or parabolic equation is a nonnegative solution u such that, ...

The Fellegi-Holt algorithm (Fellegi and Holt 1976) provides a framework for item imputation by identifying for each record with one or more edit failures a minimal set of fields that must be imputed in order to satisfy a cohesive set of edits. The set of fields is minimal in the sense that there exists at least one joint value for the fields in the set such that, when this joint value is substi...

A bargaining solution guarantees minimal equity if each player’s payoff is at least as large as the minimum of the payoffs assigned to him by the equal-gain (i.e., egalitarian) and equal-loss solutions. The KalaiSmorodinsky solution is the unique scale-invariant 2-person solution with this property. There does not exist a scale-invariant n-person solution with this property.