نتایج جستجو برای: weight updating

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

2004
K. L. Koay

When a mobile robot uses vision for self-localization and obstacle avoidance, the results of image processing become available after a variable computational delay. If the robot keeps moving during image processing, results become available after the robot has left the position where the image was taken. This is the problem of control in presence of intermittent delayed feedback. This paper pro...

Journal: :international journal of advanced design and manufacturing technology 0
hasan jalali fardin parvizi

identification of damping parameter is usually more complicated and unreliable comparing to mass or stiffness identification in structural dynamics. there are many factors such as intermolecular friction, coulomb friction and viscous damping affecting the damping mechanisms in a structure. therefore it is difficult, and in some cases impossible, to describe the details of damping mechanisms by ...

Journal: :Physics Reports 1996

Journal: :BioTechniques 2019

Journal: :Nature 2003

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

abstract chickpea is weak in competition of weeds that damages to it at between 40 t0 60 percent. kermanshah province is one of the most important region for chickpea fields in iran. for these reosons, weed management is necessary in this crop. in order to evaluate of herbicides and stubble control on broad leave weeds control in chickpea. experiment was conducted in agricultural research stat...

Journal: :Biological Systems: Open Access 2015

2011
Nikos Karampatziakis John Langford

An importance weight quantifies the relative importance of one example over another, coming up in applications of boosting, asymmetric classification costs, reductions, and active learning. The standard approach for dealing with importance weights in gradient descent is via multiplication of the gradient. We first demonstrate the problems of this approach when importance weights are large, and ...

2006
Wanliang Wang Bin Wu Yanwei Zhao Dingzhong Feng

Open Vehicle Routing Problem with Time Dependent Travel Time (OVRPTD) is different from most variants of vehilce routing problems from the liteture in that the vehicle dosen’t return to the depot after serving the last customer and the travle time is time dependent. The travle time is presented by a continuous dynamic network time dependent function. Particle Swarm Optimization with self-adapti...

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

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