Results 1  10
of
114,136
Discrete Time Scale Invariant Markov Processes
, 905
"... In this paper we consider a discrete scale invariant Markov process {X(t), t ∈ R +} with scale l> 1. We consider to have some fix number of observations in every scale, say T, and to get our samples at discrete points α k, k ∈ W, where α is obtained by the equality l = α T and W = {0, 1,...}. So ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
we provide a discrete time scale invariant Markov (DTSIM) process X(·) with parameter space {α k, k ∈ W}. We present some properties of such a DTSIM process and we show that the covariance function is characterized by the values of {RH j (1), RH j (0), j = 0, 1,...,T − 1}, where RH j (k
Oscillation of Second Order HalfLinear Dynamic Equations on Discrete Time Scales
"... In this paper, by using the Riccati techniques and algebraic inequalities, we will establish some oscillation criteria for a second order halflinear dynamic equation on a discrete time scale. ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper, by using the Riccati techniques and algebraic inequalities, we will establish some oscillation criteria for a second order halflinear dynamic equation on a discrete time scale.
Oscillation properties of an EmdenFowler type equation on discrete time scales
 J. Difference Equ. Appl
"... In this paper we explore the oscillation properties of u ∆2 (t) + p(t)u γ (σ(t)) = 0 ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper we explore the oscillation properties of u ∆2 (t) + p(t)u γ (σ(t)) = 0
Oscillation Properties of an EmdenFowler Type Equation on Discrete Time Scales
, 2002
"... In this paper, we explore the oscillation properties of uD 2 ðt Þ þ pðt Þu gðs ðt ÞÞ 0 on a time scale Twith only isolated points, where p(t) is defined on T and g is a quotient of odd positive integers. We define oscillation in this setting, and generate conditions on the integral of p(t) which gu ..."
Abstract
 Add to MetaCart
In this paper, we explore the oscillation properties of uD 2 ðt Þ þ pðt Þu gðs ðt ÞÞ 0 on a time scale Twith only isolated points, where p(t) is defined on T and g is a quotient of odd positive integers. We define oscillation in this setting, and generate conditions on the integral of p(t) which
Parallel discrete event simulation
, 1990
"... Parallel discrete event simulation (PDES), sometimes I called distributed simulation, refers to the execution of a single discrete event simulation program on a parallel computer. PDES has attracted a considerable amount of interest in recent years. From a pragmatic standpoint, this interest arises ..."
Abstract

Cited by 818 (39 self)
 Add to MetaCart
Parallel discrete event simulation (PDES), sometimes I called distributed simulation, refers to the execution of a single discrete event simulation program on a parallel computer. PDES has attracted a considerable amount of interest in recent years. From a pragmatic standpoint, this interest arises
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 SIAM J. on Computing
, 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 1277 (4 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract

Cited by 1111 (5 self)
 Add to MetaCart
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken
Virtual time
 ACM Transactions on Programming Languages and Systems
, 1985
"... Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control. Virtual time provides a flexible abstraction of real time in much the same way that virtua ..."
Abstract

Cited by 980 (7 self)
 Add to MetaCart
Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control. Virtual time provides a flexible abstraction of real time in much the same way
RealTime Dynamic Voltage Scaling for LowPower Embedded Operating Systems
, 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract

Cited by 501 (4 self)
 Add to MetaCart
life. Dynamic Voltage Scaling (DVS) has been a key technique in exploiting the hardware characteristics of processors to reduce energy dissipation by lowering the supply voltage and operating frequency. The DVS algorithms are shown to be able to make dramatic energy savings while providing
Epidemic Spreading in ScaleFree Networks
, 2000
"... The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scalefree networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from c ..."
Abstract

Cited by 575 (15 self)
 Add to MetaCart
The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scalefree networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from
Results 1  10
of
114,136