نتایج جستجو برای: through applying a genetic algorithm

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

2003
Yong-Hyuk Kim Byung Ro Moon

It is a hard problem to understand the fitness landscape of a problem as well as the evolution of genetic algorithms. For the purpose, we adopt Sammon’s mapping for the investigation. We demonstrate its usefulness by applying it to the graph partitioning problem which is a well-known NP-hard problem. Also, through the investigation of schema traces, we explain the genetic process and the reorde...

Journal: :Int. Arab J. Inf. Technol. 2008
Ragheb Toemeh Subbanagounder Arumugam

In this paper the Cryptanalysis of polyalphabetic by applying Genetic algorithm is presented. The applicability of Genetic algorithms for searching the key space of encryption scheme is studied. In Vigenere cipher, guessing the key size is done by applying Genetic Algorithm. The frequency analysis is used as an essential factor in objective function.

2005
Bo Hu Kam-Wah Tsui

Sampling from multimodal and high dimensional target distribution posits a great challenge in Bayesian analysis. This paper combines the attractive features of the distributed genetic algorithm and the Markov Chain Monte Carlo, resulting in a new Monte Carlo algorithm Distributed Evolutionary Monte Carlo (DEMC) for real-valued problems. DEMC evolves a population of the Markov chains through gen...

In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...

Journal: :روش های عددی در مهندسی (استقلال) 0
هاله خلیلی و سیدحسین امیرشاهی h. khalili s. h. amirshahi

the proposed algorithm suggests a new method for determination of k/s value of primaries based on linear least squares technique. by applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant kubelka-munk theory. the selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...

Journal: :Communications in Nonlinear Science and Numerical Simulation 2009

Brain-Computer interface systems are a new mode of communication which provides a new path between brain and its surrounding by processing EEG signals measured in different mental states.  Therefore, choosing suitable features is demanded for a good BCI communication. In this regard, one of the points to be considered is feature vector dimensionality. We present a method of feature reduction us...

2013
Mark Weiser

Load managing method on road became necessary since overloaded vehicles occur damage on road facilities and existing systems for preventing this damage still show many problems.Accordingly, efficient managing system for preventing overloaded vehicles could be organized by using the road itself as a scale by applying genetic algorithm to analyze the load and the drive information of vehicles.The...

Ahmad Reza Tahanian Maryam Khaleghi

This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...

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

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