Results 1  10
of
819
Deterministic Least Squares Filtering
, 2004
"... deterministic interpretation of the Kalman #ltering formulas is given, using theprinc#RB of least squares estimation. The observed signal and the tobeestimated signal are modeled as being generated as outputs of a #nitedimensional linear system driven by an input disturbanc, Postulating that the ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
deterministic interpretation of the Kalman #ltering formulas is given, using theprinc#RB of least squares estimation. The observed signal and the tobeestimated signal are modeled as being generated as outputs of a #nitedimensional linear system driven by an input disturbanc, Postulating
Deterministic catalytic systems are not universal
 Theoretical Computer Science 363
"... We look at a 1membrane catalytic P system with evolution rules of the form Ca → Cv or a → v, where C is a catalyst, a is a noncatalyst symbol, and v is a (possibly null) string representing a multiset of noncatalyst symbols. (Note that we are only interested in the multiplicities of the symbols.) A ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We look at a 1membrane catalytic P system with evolution rules of the form Ca → Cv or a → v, where C is a catalyst, a is a noncatalyst symbol, and v is a (possibly null) string representing a multiset of noncatalyst symbols. (Note that we are only interested in the multiplicities of the symbols
RaceTrack: Efficient detection of data race conditions via adaptive tracking
 In SOSP
, 2005
"... Bugs due to data races in multithreaded programs often exhibit nondeterministic symptoms and are notoriously difficult to find. This paper describes RaceTrack, a dynamic race detection tool that tracks the actions of a program and reports a warning whenever a suspicious pattern of activity has been ..."
Abstract

Cited by 168 (0 self)
 Add to MetaCart
Bugs due to data races in multithreaded programs often exhibit nondeterministic symptoms and are notoriously difficult to find. This paper describes RaceTrack, a dynamic race detection tool that tracks the actions of a program and reports a warning whenever a suspicious pattern of activity has
Kalman Temporal Differences: the deterministic case
 In IEEE International Symposium on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL 2009
, 2009
"... Abstract — This paper deals with value function and Qfunction approximation in deterministic Markovian decision processes. A general statistical framework based on the Kalman filtering paradigm is introduced. Its principle is to adopt a parametric representation of the value function, to model the ..."
Abstract

Cited by 18 (13 self)
 Add to MetaCart
Abstract — This paper deals with value function and Qfunction approximation in deterministic Markovian decision processes. A general statistical framework based on the Kalman filtering paradigm is introduced. Its principle is to adopt a parametric representation of the value function, to model
Deterministic distributed vertex coloring in polylogarithmic time
 In Proc. of the 29th ACM Symp. on Principles of Distributed Computing
, 2010
"... Consider an nvertex graph G = (V,E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The communication is synchronous, i.e., it proceeds in discrete rounds. In the distributed vertex coloring problem ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
Consider an nvertex graph G = (V,E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neighbors in G. The communication is synchronous, i.e., it proceeds in discrete rounds. In the distributed vertex coloring
Deterministic approximation for the cover time of trees
, 2009
"... We present a deterministic algorithm that given a tree T with n vertices, a starting vertex v and a slackness parameter ǫ> 0, estimates within an additive error of ǫ the cover and return time, namely, the expected time it takes a simple random walk that starts at v to visit all vertices of T and ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a deterministic algorithm that given a tree T with n vertices, a starting vertex v and a slackness parameter ǫ> 0, estimates within an additive error of ǫ the cover and return time, namely, the expected time it takes a simple random walk that starts at v to visit all vertices
Persistent patterns in deterministic mixing flows
, 2002
"... Abstract. – We present a theoretical approach to the description of persistent passive scalar patterns observed in recent experiments with nonturbulent timeperiodic twodimensional fluid flows. The behaviour of the passive scalar is described in terms of eigenmodes of the evolution operator which ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
for chaos, the role of molecular diffusion being taken by additive noise; we extensively use this analogy below. The evolution of a passive scalar density φ(x, y, t) in a twodimensional incompressible flow V (x, y, t) is described by the equation ∂φ + V (x,t) ·∇φ = D∆φ, (1)
Equivalence of Deterministic and Nondeterministic Epsilon Automata
"... Summary. Based on concepts introduced in Preliminaries For simplicity, we adopt the following convention: x, y, X denote sets, E denotes a non empty set, e denotes an element of E, u, u 1 , v, v 1 , v 2 , w denote elements of E ω , F denotes a subset of E ω , i, k, l denote natural numbers, T deno ..."
Abstract
 Add to MetaCart
Summary. Based on concepts introduced in Preliminaries For simplicity, we adopt the following convention: x, y, X denote sets, E denotes a non empty set, e denotes an element of E, u, u 1 , v, v 1 , v 2 , w denote elements of E ω , F denotes a subset of E ω , i, k, l denote natural numbers
Learning Optimal Control in Deterministic Systems
"... Introduction In some optimal control problems a solution cannot be obtained by standard numerical methods. This may be due to very large state spaces (as in game playing) or incomplete information such as unknown system dynamics. The mathematical model of the problem may also be either too complica ..."
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
 In Proc. 38th IEEE Symposium on Foundations of Computer Science
, 1997
"... We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NPcomplete in the BlumShubSmale model of computation over C , that it admits a s O(1) D O(n) deterministic algorithm, and that for systems with integer ..."
Abstract

Cited by 22 (7 self)
 Add to MetaCart
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NPcomplete in the BlumShubSmale model of computation over C , that it admits a s O(1) D O(n) deterministic algorithm, and that for systems
Results 1  10
of
819