نتایج جستجو برای: stochastic processing time

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

2016
Tushar Kumar

Video processing in software is often characterized by highly fluctuating, content-dependent processing times, and a limited tolerance for deadline misses. We present an approach that allows close-to-average-case resource allocation to a single video processing task, based on asynchronous, scalable processing, and QoS adaptation. The QoS adaptation balances different QoS parameters that can be ...

2005
Sharif Md. Raihan Yi Wen Bing Zeng

One basic problem in business-cycle studies is how to deal with nonstationary time series. The market economy is an evolutionary system. Economic time series therefore contain stochastic components that are necessarily time dependent. Traditional methods of business cycle analysis, such as the correlation analysis and the spectral analysis, cannot capture such historical information because the...

2009
José Niño-Mora

The field of stochastic scheduling is motivated by the design and operational problems arising in systems where scarce service resources must be allocated over time to jobs with random features vying for their attention. Important examples include manufacturing and computer-communication systems. Consider, e.g., the case of a manufacturing workstation processing different part types, where part...

Supply chain network design in perishable product has become a challenging task due to its short life time, spoilage of product in degradation nature and stochastic market demand. This paper focused on designing and optimizing model for perishable product in stochastic demand, which comprises multiple levels from producer, local collector, wholesaler and retailers. The ultimate goal is to optim...

Journal: :journal of computer and robotics 0
soheil tehranipour department of electrical and computer engineering, qazvin branch, azad university, qazvin, iran hamidreza rashidy kanan department of electrical and computer engineering, qazvin branch, azad university, qazvin, iran

generally human vision system searches for salient regions and movements in video scenes to lessen the search space and effort. using visual saliency map for modelling gives important information for understanding in many applications. in this paper we present a simple method with low computation load using visual saliency map for background subtraction in video stream. the proposed technique i...

A. Sayadian,

Storaging or transmission of speech signals at very low bit rate is a hot area in the field of speech processing. We used stochastic inter-frame interpolators and vector quantization (VQ) as a new method for developing a high quality 1200 BPS speech vocoder. The objective and subjecgtive test results show that performance of the new vocoder is compairable with 4800 BPS standard vocoders (as CELP).

2017
Ramu Seva Prashanthi Metku Minsu Choi

The high performance of FPGA (Field Programmable Gate Array) in image processing applications is justified by its flexible reconfigurability, its inherent parallel nature and the availability of a large amount of internal memories. Lately, the Stochastic Computing (SC) paradigm has been found to be significantly advantageous in certain application domains including image processing because of i...

2010
TOMMASO MINERVA

In this paper I describe a wavelet filtering approach to separate a time series, the signal, into its main components. With this approach I can separate stochastic from structural components. The statistical predictive analysis will be performed on the filtered signal while the stochastic term could be a-posteriori reintroduced through statistical simulation approaches (such as Markov Chain Mon...

A. Sayadian,

Storaging or transmission of speech signals at very low bit rate is a hot area in the field of speech processing. We used stochastic inter-frame interpolators and vector quantization (VQ) as a new method for developing a high quality 1200 BPS speech vocoder. The objective and subjecgtive test results show that performance of the new vocoder is compairable with 4800 BPS standard vocoders (as CELP).

Journal: :J. Scheduling 2008
Dan Trietsch Kenneth R. Baker

We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial time solution for any stochastically ord...

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

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