Results 11  20
of
819
Schrödinger Operators with an Electric Field and Random or Deterministic Potentials
 COMMUNICATIONS IN MATHEMATICAL PHYSICS
, 1983
"... We prove that the Schrödinger operator H = ~ + V(x)+Fx has ax purely absolutely continuous spectrum for arbitrary constant external field F, for a large class of potentials this result applies to many periodic, almost periodic and random potentials and in particular to random wells of independen ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We prove that the Schrödinger operator H = ~ + V(x)+Fx has ax purely absolutely continuous spectrum for arbitrary constant external field F, for a large class of potentials this result applies to many periodic, almost periodic and random potentials and in particular to random wells
Deterministic Approximation Algorithms for the Nearest Codeword Problem
 Technical report, Elec. Coll. on Comp. Compl., ECCC
"... Abstract. The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of errorcorrecting codes. Given a point v ∈ F n 2 and a linear space L ⊆ F n 2 of dimension k NCP asks to find a point l ∈ L that minimizes the (Hamming) distance from v. It is wellknown that the nearest cod ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
⊆ F n 2 v ∈ F n 2 that is far from L. We say that an algorithm achieves a remoteness of r for the RPP if it always outputs a point v that is at least rfar from L. In this paper we present a deterministic polynomial time algorithm that achieves a remoteness of Ω(n log k/k) for all k ≤ n/2. We motivate
The DiscoDNC v2 – A Comprehensive Tool for Deterministic Network Calculus
"... In this paper, we present the Disco Deterministic Network Calculator v2 – our continuation in the effort to provide opensource tool support for worstcase performance analysis. The major achievement of this release is the provision of a welldocumented network calculus implementation that enables ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In this paper, we present the Disco Deterministic Network Calculator v2 – our continuation in the effort to provide opensource tool support for worstcase performance analysis. The major achievement of this release is the provision of a welldocumented network calculus implementation
Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control
 SIAM J. Numer. Anal
, 1998
"... We consider the construction of Markov chain approximations for an important class of deterministic control problems. The emphasis is on the construction of schemes that can be easily implemented and which possess a number of highly desirable qualitative properties. The class of problems covered is ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
We consider the construction of Markov chain approximations for an important class of deterministic control problems. The emphasis is on the construction of schemes that can be easily implemented and which possess a number of highly desirable qualitative properties. The class of problems covered
V
"... Quantum dynamics are reversible, deterministic and continuous. However, quantum measurements are irreversible, nondeterministic, and discontinuous. Can we describe both dynamics and measurement continuously? Continuous decompositions as random walks In [OB05] it was shown that any quantum measureme ..."
Abstract
 Add to MetaCart
Quantum dynamics are reversible, deterministic and continuous. However, quantum measurements are irreversible, nondeterministic, and discontinuous. Can we describe both dynamics and measurement continuously? Continuous decompositions as random walks In [OB05] it was shown that any quantum
A Structural Construction of a Deterministic Position Automaton O.V.Shanmuga
"... Every regular expression can be transformed into a Nondeterministic Finite Automaton (NFA) with or without �transitions. A well known algorithm called subset construction technique is used for conversion of NFA into DFA. In this paper, initially, the construction of the position automaton is given ..."
Abstract
 Add to MetaCart
Every regular expression can be transformed into a Nondeterministic Finite Automaton (NFA) with or without �transitions. A well known algorithm called subset construction technique is used for conversion of NFA into DFA. In this paper, initially, the construction of the position automaton is given for the same. Also, the algorithm to convert this Position Automaton into DFA using subset construction technique is discussed. AMS MSC2010 Certification: 68Q45, 68Q70
Efficient Deterministic Algorithms for Embedding Graphs on Books
, 1996
"... We derive deterministic polynomial time algorithms for book embedding of a graph G = (V, E), V = n and E = m. In particular, we present the first deterministic polynomial time algorithm to embed any bipartite graph in O(sqrt(m)) pages. We then use this algorithm to embed, in polynomial time, any ..."
Abstract
 Add to MetaCart
We derive deterministic polynomial time algorithms for book embedding of a graph G = (V, E), V = n and E = m. In particular, we present the first deterministic polynomial time algorithm to embed any bipartite graph in O(sqrt(m)) pages. We then use this algorithm to embed, in polynomial time
A Complete Theory of Deterministic Event Structures
 Concur '95: Concurrency Theory, vol. 962 of LNCS
, 1995
"... . We present an !complete algebra of a class of deterministic event structures, which are labelled prime event structures where the labelling function satisfies a certain distinctness condition. The operators of the algebra are summation, sequential composition and join. Each of these gives rise to ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
minimal fixpoints can be defined inductively. Moreover, the submodel relation can be captured within the algebra by summation (x v y iff x + y = y); therefore the effect of fixpoints can be captured by an infinitary proof rule, yielding a complete proof system for recursively defined deterministic event
Nondeterministic Semantics for Dynamic Topological Logic
"... Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
models, which are tuples 〈X, T, f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V a truth valuation assigning subsets of X to propositional variables. Our main result is that the set of valid formulas of DT L over spaces with continuous functions is recursively enumerable. We do
Turbulence Driven by a Deterministic Chaotic Dynamics
, 2008
"... In the inertial range of fully developed turbulence, we model the vertex network dynamics by an iterated unimodular map having the universal behavior. Inertial range anomalous scaling for the pair correlation functions of the velocity and the local energy dissipation is established as a consequence ..."
Abstract
 Add to MetaCart
briefly explain the present situation in the quantum field theory of fully developed turbulence of incompressible fluid which has been developed for the last two decades (see [1] for a review). In order to be specific we consider the correlator K = 〈v(k)v(−k) 〉 of the velocity field v in the momentum
Results 11  20
of
819