Displaying similar documents to “Resonance of minimizers for n-level quantum systems with an arbitrary cost”

Structure of approximate solutions of variational problems with extended-valued convex integrands

Alexander J. Zaslavski (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this work we study the structure of approximate solutions of autonomous variational problems with a lower semicontinuous strictly convex integrand : × { } , where is the -dimensional Euclidean space. We obtain a full description of the structure of the approximate solutions which is independent of the length of the interval, for all sufficiently large intervals.

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 V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i V is controlled by . Given a set M V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 E 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:

A vertex of a graph = () is said to be by M V if the majority of the elements of the neighborhood of  (including itself) belong to . The set is a in if every vertex i V is controlled by . Given a set M V and two graphs = ( V , E 1 ) and = ( V , E 2 ) where E 1 E 2 , the consists of deciding whether there exists a sandwich graph = () (, a graph where E 1 E 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...

About the decision of reachability for register machines

Véronique Cortier (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the decidability of the following problem: given  affine functions ƒ,...,ƒ over k and two vectors v 1 , v 2 k , is reachable from by successive iterations of ƒ,...,ƒ (in this given order)? We show that this question is decidable for and undecidable for some fixed .

Control Norms for Large Control Times

Sergei Ivanov (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

A control system of the second order in time with control u = u ( t ) L 2 ( [ 0 , T ] ; U ) is considered. If the system is controllable in a strong sense and is the control steering the system to the rest at time , then the –norm of decreases as 1 / T while the L 1 ( [ 0 , T ] ; U ) –norm of is approximately constant. The proof is based on the moment approach and properties of the relevant exponential family. Results are applied to the wave equation with boundary or distributed controls.