نتایج جستجو برای: cellular learning automata

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

Journal: :Appl. Soft Comput. 2017
Meysam Ahangaran Nasrin Taghizadeh Hamid Beigy

Cellular learning automata (CLA) is a distributed computational model which was introduced in the last decade. This model combines the computational power of the cellular automata with the learning power of the learning automata. Cellular learning automata is composed from a lattice of cells working together to accomplish their computational task; in which each cell is equipped with some learni...

Journal: :iranian journal of chemistry and chemical engineering (ijcce) 2011
yazdan asgari mehrdad ghaemi mohammad ghasem mahjani

the cellular automata method has been used to simulate the pattern formation of the schlögl model as a bistable reaction-diffusion system. both microscopic and macroscopic cellular automata approaches have been considered and two different methods for obtaining the probabilities in the microscopic approach have been mentioned. the results show the tendency of the system towards the more stable ...

Journal: :Expert Syst. Appl. 2011
Javad Akbari Torkestani Mohammad Reza Meybodi

0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.01.098 ⇑ Corresponding author. E-mail addresses: [email protected] (J. Akbari ac.ir (M.R. Meybodi). Vertex coloring problem is a combinatorial optimization problem in which a color is assigned to each vertex of the graph such that no two adjacent vertices have the same color. Cellular learning automata (CLA) is an e...

Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the J...

Journal: :پژوهش های جغرافیای طبیعی 0
سمیه خالقی استادیار گروه جغرافیای طبیعی، دانشکدة علوم زمین، دانشگاه شهید بهشتی لیلا ملکانی استادیار گروه عمران، دانشکدة فنی - مهندسی مرند، دانشگاه تبریز

introduction flood is an inevitable natural phenomenon occurring from time to time in all rivers and natural drainage systems, which not only damages the lives, natural resources and environment, but also causes the loss of economy and health. so estimation and prediction flood hazard is very important spatially in the watersheds without measurement station. there are many models in the water a...

Journal: :journal of computer and robotics 0
afsaneh jalalian department of computer and communication systems engineering, faculty of engineering, universiti putra, malaysia babak karasfi faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran khairulmizam samsudin department of computer and communication systems engineering, faculty of engineering, universiti putra, malaysia m.iqbal saripan department of computer and communication systems engineering, faculty of engineering, universiti putra, malaysia syamsiah mashohor department of computer and communication systems engineering, faculty of engineering, universiti putra, malaysia

noise removal operation is commonly applied as pre-processing step before subsequent image processing tasks due to the occurrence of noise during acquisition or transmission process. a common problem in imaging systems by using cmos or ccd sensors is appearance of  the salt and pepper noise. this paper presents cellular automata (ca) framework for noise removal of distorted image by the salt an...

Journal: :IEEE Trans. Parallel Distrib. Syst. 2002
Franciszek Seredynski Albert Y. Zomaya

In this paper, we present a novel approach to designing cellular automata-based multiprocessor scheduling algorithms in which extracting knowledge about the scheduling process occurs. This knowledge can potentially be used while solving new instances of the scheduling problem. We consider the simplest case when a multiprocessor system is limited to two-processors, but we do not imply any limita...

1992
N. H. Wulff John A. Hertz

We have trained networks of E II units with short-range connections to simulate simple cellular automata that exhibit complex or chaotic behaviour. Three levels of learning are possible (in decreasing order of difficulty): learning the underlying automaton rule, learning asymptotic dynamical behaviour, and learning to extrapolate the training history. The levels of learning achieved with and wi...

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

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