Sciweavers

ICMLA
2004
14 years 25 days ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
HIS
2004
14 years 25 days ago
A Case-Based Recommender for Task Assignment in Heterogeneous Computing Systems
Case-based reasoning (CBR) is a knowledge-based problem-solving technique, which is based on reuse of previous experiences. In this paper we propose a new model for static task as...
S. Ghanbari, Mohammad Reza Meybodi, Kambiz Badie
FMCO
2006
Springer
107views Formal Methods» more  FMCO 2006»
14 years 3 months ago
Learning Meets Verification
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
Martin Leucker
AAMAS
2007
Springer
14 years 5 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
IEEECIT
2009
IEEE
14 years 6 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi