The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair (H,φ), where H is a graph in which inter-node distances are supposed to be easy to compute or at least easy to estimate. This graph is ”augmented” by links, called long range links, which are selected according to the...

Constraint modelling is difficult, particularly for novices. Hence, automated methods for improving models are valuable. The context of this paper is tailoring, a process where a solver-independent constraint model is adapted to a target solver. Tailoring is augmented with automated enhancement techniques, in particular common subexpression detection and elimination, which, while powerful, can ...

I shortly review the present status of the theoretical estimates of ε/ε . I consider a few aspects of the theoretical calculations which may be relevant in understanding the present experimental results. I discuss the role of higher order chiral corrections and in general of non-factorizable contributions for the explanation of the ∆I = 1/2 selection rule in kaon decays and ε/ε . Lacking reliab...

We analyze rare kaon decays in models in which the dominant new effect is an enhanced s̄dZ vertex Zds. We point out that in spite of large theoretical uncertainties the CP-violating ratio ε /ε provides at present the strongest constraint on ImZds. Assuming 1.5 · 10−3 ≤ ε/ε ≤ 3 · 10−3 and Standard Model values for the CKM parameters we obtain the bounds BR(KL → π0νν̄) ≤ 3.9 · 10−10 and BR(KL → πee...

This paper analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems, without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP 6⊆ coNP/poly, no efficient preprocessing algorithm can reduce n-variable instances of cnf-sat with d literals per clause, to equiv...

Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. In this paper, we extend the principle of symmetry to dominance in Not-Equals Constraint Networks and show how dominated values are detected and eliminated at each node of the search tree. A Linear time complexity algor...

We study monotonicity testing of Boolean functions over the hypergrid [n] and design a nonadaptive tester with 1-sided error whose query complexity is Õ(d) ·poly(log n, 1/ε). Previous to our work, the best known testers had query complexity linear in d but independent of n. We improve upon these testers as long as n = 2 o(1) . To obtain our results, we work with what we call the augmented hyper...

Within a financial model with linear price impact, we study the problem of hedging a covered European option under gamma constraint. Using stochastic target and partial differential equation smoothing techniques, we prove that the super-replication price is the viscosity solution of a fully non-linear parabolic equation. As a by-product, we show how ε-optimal strategies can be constructed. Fina...

-In this paper, a fast dynamical multi-objective evolutionary algorithm (DMOEA) based of the principle of the minimal free energy in thermodynamics, was developed to solve mechanical component design problems. Its performance was compared with the ε -constraint method and NSGA-II proposed by Deb et al. Simulation results show that the proposed evolutionary approach produces excellent solutions ...