Related papers: On Global Warming (Softening Global Constraints)
We search for viable f(R) theories of gravity, making use of the equivalence between such theories and scalar-tensor gravity. We find that models can be made consistent with solar system constraints either by giving the scalar a high mass…
Influence diagrams allow for intuitive and yet precise description of complex situations involving decision making under uncertainty. Unfortunately, most of the problems described by influence diagrams are hard to solve. In this paper we…
Boundary constraints in physical, environmental and engineering models restrict smooth states such as temperature to follow known physical laws at the edges of their spatio-temporal domain. Examples include fixed-state or fixed-derivative…
Hypersurfaces of arbitrary causal character embedded in a spacetime are studied with the aim of extracting necessary and sufficient free data on the submanifold suitable for reconstructing the spacetime metric and its first derivative along…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
An extension of the Legendre transform to non-convex functions with vanishing Hessian as a mix of envelope and general solutions of the Clairaut equation is proposed. Applying this to systems with constraints, the procedure of finding a…
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
In constraint programming and related paradigms, a modeller specifies their problem in a modelling language for a solver to search and return its solution(s). Using high-level modelling languages such as Essence, a modeller may express…
With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…
Global Climate Models (GCMs) provide forecasts of future climate warming using a wide variety of highly sophisticated anthropogenic CO2 emissions models as input, each based on the evolution of four emissions "drivers": population p,…
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…
We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even…
Problem of global integration of geometric structures arising in the theory of dynamical systems admitting the normal shift is considered. In the case when such integration is possible the problem of globalization for shift maps is studied.
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this paper, we give FPT algorithms for the…
In this chapter we give an overview of the consensus-based global optimization algorithm and its recent variants. We recall the formulation and analytical results of the original model, then we discuss variants using component-wise…
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…
In this communication, the current tests of gravitation available at Solar System scales are recalled. These tests rely mainly on two frameworks: the PPN framework and the search for a fifth force. Some motivations are given to look for…
Survey Propagation is an algorithm designed for solving typical instances of random constraint satisfiability problems. It has been successfully tested on random 3-SAT and random $G(n,\frac{c}{n})$ graph 3-coloring, in the hard region of…
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for…