نتایج جستجو برای: delta learning algorithm

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

Journal: :تحقیقات اقتصاد و توسعه کشاورزی ایران 0
میترا ژاله رجبی دانشجوی دکتری دانشگاه آزاد اسلامی واحد علوم و تحقیقات تهران ناصر شاهنوشی دانشیار دانشگاه فردوسی مشهد محمود دانشور دانشیار دانشگاه فردوسی مشهد علی فیروز زارع دانشجوی دوره دکتری اقتصاد کشاورزی، دانشگاه فردوسی مشهد سیاوش دهقانیان استاد بازنشسته دانشگاه فردوسی مشهد سید محمد علی رضوی دانشیار دانشگاه فردوسی مشهد

this paper presents the application of multivariate time series model (ardl) to investigate factors affecting bread waste and to explore the relationships among shortrun, longrun and error correction coefficient and the independent variables over the period 1978-2006. results reveal that gross national product and urbanization have positive effects on bread waste in the long term, while the bre...

Journal: :journal of agricultural science and technology 2010
s. r. hassan-beygi b. ghobadian r. amiri chayjan m. h. kianmehr

the use of neural networks methodology is not as common in the investigation and pre-diction noise as statistical analysis. the application of artificial neural networks for pre-diction of power tiller noise is set out in the present paper. the sound pressure signals for noise analysis were obtained in a field experiment using a 13-hp power tiller. during measurement and recording of the sound ...

Learning to rank refers to machine learning techniques for training a model in a ranking task. Learning to rank has been shown to be useful in many applications of information retrieval, natural language processing, and data mining. Learning to rank can be described by two systems: a learning system and a ranking system. The learning system takes training data as input and constructs a ranking ...

2008
Fernando Mateo Amaury Lendasse

Extreme Learning Machine, ELM, is a newly available learning algorithm for single layer feedforward neural networks (SLFNs), and it has proved to show the best compromise between learning speed and accuracy of the estimations. In this paper, a methodology based on Optimal-Pruned ELM (OP-ELM) for function approximation enhanced with variable selection using the Delta Test is introduced. The leas...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده علوم ریاضی 1392

یک فضای نرمدار احتمالی، دارای شرایط یک فضای نرمدار حقیقی است، که در آن نرم هر عضو بجای یک مقدار حقیقی در $br$، یک مقدار احتمالی در $delta$ اختیار می کند. در اینجا $delta$ مجموعه همه توابع صعودی و پیوسته چپ، که به فرم $f:br obac$ است، می باشد. که در اصطلاح به این گونه توابع، توابع توزیع توسیعی می گویند. ایده ای که برای اولین بار توسط یک ریاضیدان، بنام شرستنو در سال ???? میلادی بیان گردید. د...

Journal: :the modares journal of electrical engineering 2006
mohammadreza meybodi farhad mehdipour

in this paper an application of cellular learning automata (cla) to vlsi placement is presented. the cla, which is introduced for the first time in this paper, is different from standard cellular learning automata in two respects. it has input and the cell neighborhood varies during the operation of cla. the proposed cla based algorithm for vlsi placement is tested on number of placement proble...

In general case, Chambers et al. (1976) introduced the following algorithm for simulating any stable random variables $ X/sim(alpha, beta, gamma, delta) $ with four parameters. They use a nonlinear transformation of two independent uniform random variables for simulating an stable random variable... (to continue, click here)

Journal: :journal of advances in computer research 2013
sedigheh navaezadeh iman zangeneh mehnoosh vahebi

every year, with regard to rapid development of data, grid computing that is a kind of distributed computing system is that it has attracted the attention of most people and considerably taken into account. computing that cannot be done by huge computers can be performed by grid computing. if load balance is used, efficiency will increase in grid. resources have an important and effective role ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی خواجه نصیرالدین طوسی - دانشکده علوم 1392

یک $k$-رنگ آمیزی یالی در گراف $g$ تابعی مانند $f:e(g)longrightarrow l$ می باشد به طوری که $|l|=k$ و برای هر دو یال مجاور $e_1$ و $e_2$ در $g$، داشته باشیم $f(e_1) eq f(e_2)$. گراف $g$، $k$-رنگ پذیر یالی است اگر برای $g$ یک $k$-رنگ آمیزی یالی وجود داشته باشد. عدد رنگی یالی گراف $g$ که با نماد $chi(g)$ نمایش داده می شود، کوچکترین مقدار $k$ است که $g$ دارای $k$-رنگ آمیزی یالی است. مشهورترین قضی...

1987
J. Bernasconi

We investigate the behavior of different learning algorithms for networks of neuron-like units. As test cases we use simple pattern association problems, such as the XOR-problem and symmetry detection problems. The algorithms considered are either versions of the Boltzmann machine learning rule or based on the backpropagation of errors. We also propose and analyze a generalized delta rule for l...

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

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