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

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس - دانشکده علوم پایه 1386

چکیده ندارد.

Journal: :Telecommunication Systems 2022

The characterization of multipath fading and shadowing in wireless communication systems is essential towards the evaluation various performance measures. It well known that statistical phenomena captured by distributions viz., log-normal distribution, gamma distribution other mixture distributions. However, it observed fails to characterize outliers signal. extreme fluctuations signal needs be...

2015
Bharat Kumar Saxena

Introduction: Wind speed probability at a site has to be modeled for evaluating the energy generation potential of a wind farm. Analytical computation of wind turbine capacity factor at the planning stage of a wind farm is very crucial. Thus, the comparison of Weibull parameters estimation methods and computation of wind turbine capacity factor are the focus of this paper. Case description: Sod...

Journal: :journal of agricultural science and technology 2010
m. r. najafi shahri s. m. r. behbahani

this paper describes a simple, physically-based conceptual model utilizing watershed drainage characteristics for rainfall-runoff simulation. this conceptual physiographic model is essentially based on the work of najafi (2003), which has led to a model compris-ing the main tributary subwatersheds and a single main channel subwatershed. the ki-nematic wave (kw) theory is used to describe flow o...

Journal: :Operations Research Forum 2023

Abstract We provide a preprocessing method to reduce the vehicle capacity for instances of capacitated routing problem. This improves LP bound many formulations It also speeds up common algorithms which computation time depends on capacity. Our simulation experiments suggest that, perhaps surprisingly, often is very tight in sense that it cannot be reduced by much.

1990
Israel Cidon Inder S. Gopal Shay Kutten

The common practice in distributed algorithms research was to assume that the computation time is zero, and assign a cost only to the communication. This was justified at the times that the communication was the bottleneck of a network. However, lately there has been a dramatic increase in the capacity of communication links so that we can no longer make this assumption. In this paper we fred o...

1966
Alan Cobham

Lower bound~ on the capacity and on the product of capacity and computation time are obtained for machines which recognize the set of squares. The bound on capacity is approached to within a factor of four by a specific machine which carries out a test based on the fact that every non-square is a quadratic non-residue of some rational prime. A machine which carries out a te st based on the stan...

Journal: :Physical review letters 2012
M F Santos M Terra Cunha R Chaves A R R Carvalho

Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that, when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious ...

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

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