A CAT algorithm for the exhaustive generation of ice piles

Paolo Massazza; Roberto Radicioni

Displaying similar documents to “A CAT algorithm for the exhaustive generation of ice piles”

Uniqueness of renormalized solutions to nonlinear elliptic equations with a lower order term and right-hand side in (Ω)

M. F. Betta, A. Mercaldo, F. Murat, M. M. Porzio (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this paper we prove uniqueness results for the renormalized solution, if it exists, of a class of non coercive nonlinear problems whose prototype is  $\{- div (a (x) (1 + {| \nabla u |}^{2})^{\frac{p - 2}{2}} {\nabla u) + b (x) (1 + | \nabla u |}^{2})^{\frac{λ}{2}} = f in Ω, u = 0 on \partial Ω,$  where Ω is a bounded open subset of $ℝ^{N}$ , N > 2, 2-1/, belongs to (Ω), $a (x) \geq α_{0} > 0$ , is a function in (Ω), is a function in $L^{r} (Ω)$ and 0 ≤ λ < λ *(), for some and λ *().

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by $M \subseteq V$ if the majority of the elements of the neighborhood of (including itself) belong to . The set is a in if every vertex $i \in V$ is controlled by . Given a set $M \subseteq V$ and two graphs = ( $V, E_{1}$ ) and = ( $V, E_{2}$ ) where $E_{1} \subseteq E_{2}$ , the consists of deciding whether there exists a sandwich graph = () (, a graph where $E_{1} \subseteq E \subseteq E_{2}$ ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity: