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

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

Journal: :international journal of robotics 0
abdolreza gharahsofloo faculty of mechanical engineering, sahid rajaee teacher training university, tehran, iran, p.o. box , 16785-136 ali rahmani hanzaki faculty of mechanical engineering, sahid rajaee teacher training university, tehran, iran, p.o. box , 16785-136

dimensional synthesis of a parallel robot may be the initial stage of its design process, which is usually carried out based on a required workspace. since optimization of the links lengths of the robot for the workspace is usually done, the workspace computation process must be run numerous times. hence, importance of the efficiency of the algorithm and the cpu time of the workspace computatio...

Journal: :فیزیک زمین و فضا 0
علیرضا آزموده اردلان مهدی روفیان نایینی

a method for deformation computation based on strain tensor elements, as an alternative to the usual way of application of gradient of displacement vector, is proposed. the method computes directly the strain tensor elements from the computed/observed changes in distances and angles between the stations of a geodetic network in two epochs of observations. displacement vector which is determined...

A theoretical relation is presented between the seismological Fourier amplitude spectrumand the mean squared value of the elastic response, which is defined by Gaussian distribution. Byshifting a general process to its mean value, spectrum of the mean squared value of the displacementis computed from the Fourier amplitude spectrum and the real part of the relative displacementtransfer function ...

M. Amirfakhrian P. Mohammadi Khanghah,

In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.

2006
Juan C. Agudelo Walter Carnielli

We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefly describe the standard models of quantum computation: quantum Turing machines and quantum circuits, and revise quantum algorithms to solve the so-called Deutsch’s problem and Deutsch-Jozsa problem. Then, we sh...

Journal: :Journal of the Royal Statistical Society: Series B (Statistical Methodology) 2012

1998
Dorit Aharonov

In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically powerful computational tool, capable of performing tasks which seem intractable for classical computers. This review is about to tell the story of theoretical quant...

Journal: :Journal of Approximation Theory 2010

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

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