نتایج جستجو برای: verified computation

تعداد نتایج: 210263  

2016
Mei Li

This paper proposes an optical method to perform a balanced ternary vector-matrix multiplication. Inspired by ternary optical computer‘s ability to process ternary information, we study techniques to realize ternary vector-matrix multiplication (VMM) based on the work of manipulating binary VMM computation. The principle and specific working flow is described in detail and the correctness of th...

2006
Kohji Kamejima

With a view to nondeterministic solution of undecidability problems, integrated stochastic computational scheme is presented for detecting and designing self-similarity in complex patterns. Based on Brownian motion modeling of unknown attractors, a conditional probability measure is induced on image plane. With the basis of this infinite dimensional information, computation processes are formul...

2007
Michael Eichler Vanessa Didelez

We propose a definition of causality for time series in terms of the effect of an intervention in one component of a multivariate time series on another component at some later point in time. Conditions for identifiability, comparable to the back–door and front–door criteria, are presented and can also be verified graphically. Computation of the causal effect is derived and illustrated for the ...

2013
Brian C. Hall

then so is the curve x(−t), as is easily verified by direct computation. (Note that d/dt(x(−t)) = ẍ(−t), since the two derivatives pull out two minus signs.) In terms of trajectories in phase space, we note that dx(−t)/dt = −ẋ(−t). This means that the momentum of the particle along the time-reversed trajectory is the negative of the momentum along the original trajectory. We may therefore formu...

Journal: :Applied Mathematics and Computer Science 2007
Shaolin Hu Karl Meinke Rushan Chen Ouyang Huajiang

A new kind of linear model with partially variant coefficients is proposed and a series of iterative algorithms are introduced and verified. The new generalized linear model includes the ordinary linear regression model as a special case. The iterative algorithms efficiently overcome some difficulties in computation with multidimensional inputs and incessantly appending parameters. An important...

2009
Suzana Andova Sonja Georgievska

A branching bisimulation for probabilistic systems that is preserved under parallel composition has been defined recently for the alternating model. We show that besides being compositional, it is decidable in polynomial time and it preserves the properties expressible in probabilistic Computation Tree Logic (pCTL). In the ground-complete axiomatization, only a single axiom is added to the axio...

Journal: :CoRR 2017
Jinke Ren Guanding Yu Yunlong Cai Yinghui He

By offloading intensive computation tasks to the edge cloud located at the cellular base stations, mobile-edge computation offloading (MECO) has been regarded as a promising means to accomplish the ambitious millisecond-scale end-to-end latency requirement of the fifth-generation networks. In this paper, we investigate the latency-minimization problem in a multi-user time-division multiple acce...

Journal: :Bulletin of the London Mathematical Society 2020

Journal: :Journal of Automated Reasoning 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید