Consider a constraint on a sequence of variables functionally determining a result variable that is unchanged under reversal of the sequence. Most such constraints have a compact encoding via an automaton augmented with accumulators, but it is unknown how to maintain domain consistency efficiently for most of them. Using such an automaton for such a constraint, we derive an implied constraint b...

It is well-known that in combination with further premises that look less controversial, the tolerance principle – the constraint that if Pa holds, and a and b are similar in P -relevant respects, Pb holds as well – leads to contradiction, namely to the sorites paradox. According to many influential views of the sorites paradox (e.g. Williamson 1994), we therefore ought to reject the principle ...

This paper deals with systems of fuzzy inequalities. It shows that a system of fuzzy inequalities with piecewise linear membership functions can be converted to a one-constraint nonlinear programming problem by employing the concepts of constraint surrogation and maximum entropy. An augmented Lagrangean algorithm is then applied to solve the resulting problem. Some computational results are inc...

We design approximation algorithms for Unique Games when the constraint graph admits good low diameter graph decomposition. For the Max-2Link problem in Kr-minor free graphs, when there is an assignment satisfying 1 − ε fraction of constraints, we present an algorithm that produces an assignment satisfying 1−O(rε) fraction of constraints, with the approximation ratio independent of the alphabet...

∂νu = 0, on ∂Ω, where ν denotes a unit vector field normal to ∂Ω and where ε λ ∈ R corresponds to the Lagrange multiplier associated to the constraint V (u) = c0 |Ω|. One can also ignore the volume constraint, in which case a critical point would satisfy equation (1.1) with λ = 0. Since classical methods of the calculus of variation apply, there is no difficulty in finding minimizers of Eε. The...

In this paper, a new general scalarization technique for solving multiobjective optimization problems is presented. After studying the properties of this formulation, two problems as special cases of this general formula are considered. It is shown that some well-known methods such as the weighted sum method, the -constraint method, the Benson method, the hybrid method and the elastic -constrai...

Variability of neutron rich isotopes in meteorites can yield information about early solar system processes, and the nucleosynthetic sources the accreted to form the solar system. Excesses of neutron rich nuclides in bulk meteorite analyses of iron peak elements were initially reported for Ti [1; 2] and later augmented by similar observations for Cr [3]. This early work has been supported by se...

Proof. We apply Lemma 3.1 of (Jayram & Woodruff, 2013) with parameters α = 2, p = 1, b = 1, ε = δ, and δ = . This encodes inputs from a problem they prove is hard (augmented indexing on large domains) to inputs appropriate for Hamming estimation. In particular, for n′ = O( 1 δ2 log(1/ )) it gives a distribution on (a, b) ∈ {0, 1} n′ × {0, 1}n that are divided into “NO” and “YES” instances, such...

Shape-constrained convex regression problem deals with fitting a function to the observed data, where additional constraints are imposed, such as component-wise monotonicity and uniform Lipschitz continuity. This paper provides unified framework for computing least squares estimator of multivariate shape-constrained in $${\mathbb {R}}^d$$ . We prove that is computable via solving an essentially...