Sciweavers

473 search results - page 10 / 95
» Rank based variation operators for genetic algorithms
Sort
View
PODS
2005
ACM
86views Database» more  PODS 2005»
14 years 1 months ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv
TSP
2008
123views more  TSP 2008»
13 years 7 months ago
A Rough Programming Approach to Power-Balanced Instruction Scheduling for VLIW Digital Signal Processors
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
Shu Xiao, Edmund Ming-Kit Lai
ICEC
1994
86views more  ICEC 1994»
13 years 9 months ago
A Genetic Algorithm for Channel Routing using Inter-Cluster Mutation
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance ...
B. B. Prahlada Rao, Lalit M. Patnaik, R. C. Hansda...
ASPDAC
2006
ACM
129views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Yield-area optimizations of digital circuits using non-dominated sorting genetic algorithm (YOGA)
With shrinking technology, the timing variation of a digital circuit is becoming the most important factor while designing a functionally reliable circuit. Gate sizing has emerged...
Vineet Agarwal, Janet Meiling Wang
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
13 years 11 months ago
A comparative study of immune system based genetic algorithms in dynamic environments
Diversity and memory are two major mechanisms used in biology to keep the adaptability of organisms in the everchanging environment in nature. These mechanisms can be integrated i...
Shengxiang Yang