نتایج جستجو برای: . Fix Learning automata

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

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

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...

Journal: :journal of advances in computer engineering and technology 2015
somayeh taherian dehkordi vahid khatibi bardsiri

since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. this rese...

Journal: :journal of advances in computer research 0
mostafa moradi department of computer, baghmalek branch, islamic azad university, baghmalek, iran

ad hoc mobile networks have dynamic topology with no central management. because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .in the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...

Journal: :journal of computer and robotics 0
samaneh assar faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran behrooz masoumi faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran

multi agent markov decision processes (mmdps), as the generalization of markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for multi agent reinforcement learning. in this paper, a generalized learning automata based algorithm for finding optimal policies in mmdp is proposed. in the proposed algorithm, mmdp ...

Journal: :journal of computer and robotics 0
ali safari mamaghani islamic azad university of qazvin kayvan asghari islamic azad university of iran farborz mahmoudi islamic azad university of qazvin mohammad reza meybodi amirkabir university of technology iran

optimizing the database queries is one of hard research problems. exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. the use of evolutionary methods, beca...

Journal: :journal of advances in computer research 2015
shirin khezri amjad osmani behdis eslamnour

coverage improvement is one of the main problems in wireless sensor networks. given a finite number of sensors, improvement of the sensor deployment will provide sufficient sensor coverage and save cost of sensors for locating in grid points. for achieving good coverage, the sensors should be placed in adequate places. this paper uses the genetic and learning automata as intelligent methods for...

2016
Devendra Bhave Vrunda Dave Shankara Narayanan Krishna Ramchandra Phawade Ashutosh Trivedi

Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by making the call-return edges visible and by making the clock-reset operation visible, respectively—recover decidabili...

Ali Safari Mamaghani Farborz Mahmoudi, Kayvan Asghari Mohammad Reza Meybodi

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

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

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