• Aucun résultat trouvé

constrained models

Bootstrap percolation and kinetically constrained models in homogeneous and random environments

Bootstrap percolation and kinetically constrained models in homogeneous and random environments

... Kinetically Constrained Models and Bootstrap Per- colation, two topics in the intersection between probability, combinatorics and sta- tistical ...Kinetically constrained models were ...

103

Kinetically constrained models : relaxation to equilibrium and universality results

Kinetically constrained models : relaxation to equilibrium and universality results

... kinetically constrained models (KCMs), that were introduced by physicists to model the liquid-glass transition, an important open problem of condensed matter physics (see for example [RS03, BB11] for ...

197

TOWARDS A UNIVERSALITY PICTURE FOR THE RELAXATION TO EQUILIBRIUM OF KINETICALLY CONSTRAINED MODELS

TOWARDS A UNIVERSALITY PICTURE FOR THE RELAXATION TO EQUILIBRIUM OF KINETICALLY CONSTRAINED MODELS

... general constrained Poincar´ e inequality proved in Theorem 1 to develop a quite robust and general scheme proving a special kind of Poincar´ e constrained inequality ...kinetically constrained ...

26

Universality for critical kinetically constrained models: infinite number of stable directions

Universality for critical kinetically constrained models: infinite number of stable directions

... critical models is proved in a companion paper by Martinelli and the first and third authors [20] and, in particular, Conjecture 3(a) of [26] is disproved for models other than those covered by Theorem ...

33

Universality for critical kinetically constrained models: infinite number of stable directions

Universality for critical kinetically constrained models: infinite number of stable directions

... over the stationary process started at µ of the first time at which the origin becomes empty. Several works have been devoted to the study of these time scales for some specific choices of the constraints [2, 9, 12, 13, ...

33

Combinatorics for general kinetically constrained spin models

Combinatorics for general kinetically constrained spin models

... 2010 Mathematics subject classification: Primary 60K35, Secondary 05C75. Key words. Kinetically constrained models, bootstrap percolation. 1. Introduction In this article, we study a generalization of a ...

14

Universality Results for Kinetically Constrained Spin
Models in Two Dimensions

Universality Results for Kinetically Constrained Spin Models in Two Dimensions

... Kinetically constrained models (KCM) are reversible interacting particle systems on Z d with continuous time Markov dynamics of Glauber type, which represent a natural stochastic (and non-monotone) ...

56

Constrained Density Functional Theory

Constrained Density Functional Theory

... the constrained Fock matrices are then applied to the historic core Fock matrices to yield an extrapolated core Fock matrix; the microiterations to determine the constraint potentials add a constraint potential to ...

173

Hub dependence in constrained economies

Hub dependence in constrained economies

... Abstract While the geographical and economic factors concerning the development of hub ports are widely described by a variety of scholars and professionals, there is no recognized methodology measuring the hub ...

32

On Tree-Constrained Matchings and Generalizations

On Tree-Constrained Matchings and Generalizations

... Theorem 3. For an instance I = (T 1 , T 2 , w) of TCBM, with w : V 1 × V 2 7→ {0, 1}, and an integer k, it is N P-complete to decide whether there exists a tree-constrained bipartite matching of weight at least ...

16

Entrepreneurship, outside options and constrained

Entrepreneurship, outside options and constrained

... the constrained efficient allocation (β = 1 − α), as from equation (8), a larger share of productivity accrues to the firm, and hence a smaller increase in  maintains the ...the constrained efficient ...

22

Size-Constrained Tree Decompositions

Size-Constrained Tree Decompositions

... treewidth graphs, efficient (i.e., practical) algorithms exist to compute tree-decompositions with optimal width. More- over, in such case, the time-complexity of above-mentioned dynamic programming algorithms becomes ...

24

Constrained Palette-Space Exploration

Constrained Palette-Space Exploration

... Palette optimization for Color Vision Deficiencies (CVD) rather focuses on finding a balance between aesthetic and accessibility con- straints. Such problems are usually over-constrained, and enable the use of ...

15

Cluster-size constrained network partitioning

Cluster-size constrained network partitioning

... ε(σ, v) = −σ(v) X w∼v σ(w). (2) In the steps of our algorithms (to be described in detail a bit further) we shall do updates based on local energies and keep the numbers of black and white nodes as invariants, which is a ...

9

Toward Constrained Semantic WoT

Toward Constrained Semantic WoT

... Research work in the Sensor Network field faces challenges that can often be applied to constrained nodes. Wireless Sensor Networks have also implemented power saving modes of operation such as Power Aware Sensor ...

7

Hamilton-Jacobi equations constrained on networks

Hamilton-Jacobi equations constrained on networks

... In (2.7), we see that for small durations, an admissible control law at x ∈ G\{O} cannot take values outside A x (except maybe on a negligible set of times). The identity in (2.5) characterizes the set of constant ...

28

Bandwidth Constrained Multi-interface Networks

Bandwidth Constrained Multi-interface Networks

... In this setting, we study the problem of establishing a communication path between two selected nodes s, t ∈ V of minimum cost in terms of energy consumption, while guaranteeing a minimu[r] ...

13

Constrained rewriting in recognizable theories

Constrained rewriting in recognizable theories

... true for any valuation α. The set of all models of ϕ is denoted by Mod(ϕ) and for any theory Γ , Mod(Γ ) is the set of interpretations which are models of all formulae in Γ . We write Γ |= ϕ iff for any = ∈ ...

20

Efficient Global Optimization for high-dimensional constrained problems by using the Kriging models combined with the Partial Least Squares method

Efficient Global Optimization for high-dimensional constrained problems by using the Kriging models combined with the Partial Least Squares method

... two models KPLS and KPLS+K developed for high- dimensional problems by KPLS(+K) in the ...to constrained black-box optimization problems in high ...the constrained optimization problem, and describe ...

32

Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method

Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method

... 4.2.2 Description of the COBRA algorithm SEGOKPLS+K will be compared with an algorithm called COBRA Regis 2014 that is designed for constrained black-box optimization when the objective [r] ...

22

Show all 4874 documents...

Sujets connexes