| Genetic
Algorithms: Papers
Distributed
Evaluation Functions for Fault Tolerant Multi-Rover Systems
(Page 1079)
A. Agogino (University of California at Santa Cruz)
K. Tumer (NASA Ames Research Center)
Structure
and Metaheuristics (Page 1087)
Y. Borenstein, R. Poli (University of Essex)
A
General Coarse-Graining Framework for Studying Simultaneous Inter-Population
Constraints Induced By Evolutionary Operations
(Page 1095)
K. Burjorjee, J. B. Pollack (Brandeis University)
Adaptive
Discretization for Probabilistic Model Building Genetic Algorithms
(Page 1103)
C.-H. Chen, W.-N. Liu, Y.-P. Chen (National Chiao
Tung University)
Crossover
Gene Selection by Spatial Location
(Page 1111)
D. M. Cherba, W. Punch (Michigan State University)
Properties
of Symmetric Fitness Functions
(Page 1117)
S.-S. Choi , Y.-K. Kwon, B.-R. Moon (Seoul National
University)
Non-Wrapping
Order Crossover: An Order Preserving Crossover Operator that Respects
Absolute Position
(Page 1125)
V. A. Cicirello (The Richard Stockton College of New
Jersey)
gLINC:
Identifying Composability using Group Perturbation
(Page 1133)
D. J. Coffin, C. D. Clack (University College London)
Multi-Objective
Test Problems, Linkages, and Evolutionary Methodologies
(Page 1141)
K. Deb, A. Sinha (Indian Institute of Technology)
S. Kukkonen (Lappeenranta University of Technology)
An
Empirical Investigation of How and Why Neutrality Affects Evolutionary
Search (Page 1149)
E. Galván-López, R. Poli (University of Essex)
A
Hybrid of Genetic Algorithm and Bottleneck Shifting for Flexible Job
Shop Scheduling Problem (Page
1157)
J. Gao (Xi'an Jiaotong University)
M. Gen (Waseda University)
L. Sun (Xi'an Jiaotong University)
Robot
Gaits Evolved by Combining Genetic Algorithms and Binary Hill Climbing
(Page 1165)
L. M. Garder, M. E. Hřvin (University of Oslo)
Segmentation
of Medical Images Using a Genetic Algorithm
(Page 1171)
P. Ghosh, M. Mitchell (Portland State University)
A
Tree-Based Genetic Algorithm for Building Rectilinear Steiner Arborescences
(Page 1179)
W. A. Greene (University of New Orleans)
Neighbourhood
Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded
in a VNS, EA, and ACO (Page
1187)
M. Gruber (Vienna University of Technology)
J. van Hemert (University of Edinburgh)
G. R. Raidl (Vienna University of Technology)
Fitness
Function for Finding out Robust Solutions on Time-Varying Functions
(Page 1195)
H. Handa (Okayama University)
Dynamic
Multi-Objective Optimization with Evolutionary Algorithms: A Forward-Looking
Approach (Page 1201)
I. Hatzakis, D. Wallace (Massachusetts Institute of
Technology)
Multi-Attractor
Gene Reordering for Graph Bisection
(Page 1209)
I. Hwang, Y.-H. Kim, B.-R. Moon (Seoul National University)
Geometric
Crossover for Multiway Graph Partitioning
(Page 1217)
Y.-H. Kim, Y. Yoon (Seoul National University)
A. Moraglio (University of Essex)
B.-R. Moon (Seoul National University)
A
Splicing/Decomposable Encoding and Its Novel Operators for Genetic Algorithms
(Page 1225)
Y. Liang, K.-S. Lueng, K.-H. Lee (The Chinese University
of Hong Kong)
On
the Utility of the Multimodal Problem Generator for Assessing the Performance
of Evolutionary Algorithms
(Page 1233)
F. G. Lobo, C. F. Lima (University of Algarve)
Revisiting
Evolutionary Algorithms with On-the-Fly Population Size Adjustment
(Page 1241)
F. G. Lobo, C. F. Lima (University of Algarve)
Spectral
Techniques for Graph Bisection in Genetic Algorithms
(Page 1249)
J. G. Martin (University of Georgia)
A
Fast Hybrid Genetic Algorithm for the Quadratic Assignment Problem
(Page 1257)
A. Misevicius (Kaunas University of Technology)
A
New Generation Alternation Model for Differential Evolution
(Page 1265)
N. Noman, H. Iba (The University of Tokyo)
How
an Optimal Observer can Collapse the Search Space
(Page 1273)
C. Philemotte, H. Bersini (Université Libre de Bruxelles)
The
LEM3 Implementation of Learnable Evolution Model and Its Testing on
Complex Function Optimization Problems
(Page 1281)
J. Wojtusiak, R. S. Michalski (George Mason University)
The
Effect of Crossover on the Behavior of the GA in Dynamic Environments:
A Case Study using the Shaky Ladder Hyperplane-Defined Functions
(Page 1289)
W. Rand (Northwestern Institute on Complex Systems)
R. Riolo, J. H. Holland (University of Michigan)
Selecting
for Evolvable Representations
(Page 1297)
J. Reisinger , R. Miikkulainen (University of Texas
at Austin)
Comparison
of Multi-Modal Optimization Algorithms Based on Evolutionary Algorithms
(Page 1305)
G. Singh (Wright State University)
K. Deb (Indian Institute of Technology Kanpur)
"Optimal"
Mutation Rates for Genetic Search
(Page 1313)
J. Cervantes, C. R. Stephens (Universidad Nacional
Autonoma de Mexico)
Comparing
Evolutionary and Temproal Difference Methods in a Reinforcement Learning
Domain (Page 1321)
M. E. Taylor, S. Whiteson, P. Stone (The University
of Texas at Austin)
Combining
Genetic Algorithms with Squeaky-Wheel Optimization
(Page 1329)
J. Terada, H. Vo, D. Joslin (Seattle University)
A
Crossover for Complex Building Blocks Overlapping
(Page 1337)
M. Tsuji, M. Munetomo, K. Akama (Hokkaido University)
Use
of Statistical Outlier Detection Method in Adaptive Evolutionary Algorithms
(Page 1345)
J. M. Whitacre, T. Q. Pham, R. A. Sarker (University
of New South Wales)
Credit
Assignment in Adaptive Evolutionary Algorithms
(Page 1353)
J. M. Whitacre, T. Q. Pham, R. A. Sarker (University
of New South Wales)
Fluctuating
Crosstalk, Deterministic Noise, and GA Scalability
(Page 1361)
P. Winward, D. E. Goldberg (University of Illinois
at Urbana-Champaign)
Strong
Recombination, Weak Selection, and Mutation
(Page 1369)
A. H. Wright (University of Montana)
J. N. Richter (Montana State University)
A
Comparative Study of Immune System Based Genetic Algorithms in Dynamic
Environments (Page 1377)
S. Yang (University of Leicester)
Conquering
Hierarchical Difficulty by Explicit Chunking: Substructural Chromosome
Compression (Page 1385)
T.-L. Yu, D. E. Goldberg (University of Illinois at
Urbana-Champaign)
Genetic
Algorithms: Posters
Instance
Similarity and the Effectiveness of Case Injection in a Genetic Algorithm
for Binary Quadratic Programming
(Page 1395)
J. Amunrud, B. A. Julstrom (St. Cloud State University)
A
Comparative Study of Evolutionary Optimization Techniques in Dynamic
Environments (Page 1397)
D. Ayvaz (Bogazici University)
H. Topcuoglu (Marmaru University)
F. Gurgen (Bogazici University)
The
No Free Lunch and Realistic Search Algorithms
(Page 1399)
Y. Borenstein, R. Poli (University of Essex)
Classes
of Problems in the Black Box Scenario
(Page 1399)
Y. Borenstein, R. Poli (University of Essex)
A
Genetic Model Based on Simulated Crossover of Quaternary Genes for Quadratic
Fitness (Page 1403)
M. Carpentieri , V. Fedullo (Universitŕ di Salerno)
Variable
Length Genetic Algorithms with Multiple Chromosomes on a Variant of
the Onemax Problem: Investigating Changes in Chromosome Length
(Page 1405)
R. Cavill, S. L. Smith , A. M. Tyrrell (University
of York)
Improving
Genetic Algorithm Performance with Intelligent Mappings from Chromosomes
to Solutions (Page 1407)
J. Collins, D. Joslin (Seattle University)
The
Snake in the Box Problem: Mathematical Conjecture and a Genetic Algorithm
Approach (Page 1409)
P. A. Diaz-Gomez, D. F. Hougen (University of Oklahoma)
A
New Approach for Shortest Path Routing Problem by Random Key-based GA
(Page 1411)
M. Gen, L. Lin (Waseda University)
Solving
Identification Problem for Asynchronous Finite State Machines Using
Genetic Algorithms (Page 1413)
X. Geng (California State University)
iECGA:
Integer Extended Compact Genetic Algorithm
(Page 1415)
P.-C. Hung, Y.-P. Chen (National Chiao Tung University)
Analyzing
Active Interactive Genetic Algorithms using Visual Analytics
(Page 1417)
X. Llorŕ, K. Sastry (University of Illinois)
F. Alías (Universitat Ramon Lluli)
D. E. Goldberg, M. Welge (University of Illinois)
Extraction
of Landscape Information based on a Quality Control Approach and Its
Applications to Mutation in GA
(Page 1419)
M. Matayoshi , M. Nakamura, H. Miyagi (University
of the Ryukyus)
Generalized
Cycle Crossover for Graph Partitioning
(Page 1421)
A. Moraglio (University of Essex)
Y.-H. Kim, Y. Yoon , B.-R. Moon (Seoul National University)
R. Poli (University of Essex)
Mating
Networks in Steady State Genetic Algorithms are Scale Free
(Page 1423)
M. K. Oner, I. I. Garibay, A. S. Wu (University of
Central Florida)
Distributed
Genetic Algorithm for Energy-Efficient Resource Management in Sensor
Networks (Page 1425)
Q. Qiu, Q. Wu (Binghamton University)
D. Burns, D. Holzhauer (Air Force Research Laboratory)
Estimating
the Destructiveness of Crossover on Binary Tree Representations
(Page 1427)
L. Sheneman, J. A. Foster (University of Idaho)
Multi-Objective
Diversity Maintenance (Page
1429)
P. Snijders (Groningen University)
E. D. de Jong (Utrecht University)
B. de Boer, F. Weissing (Groningen University)
Game
Theory as a New Paradigm for Phenotype Characterization of Genetic Algorithms
(Page 1432)
O. N. Teixeira (Centro Universitário do Pará - CESUPA,
Universidade Federal do Pará-UFPA)
A. N. Teixeira, F. H. de Brito, R. C.L. de Oliveira (Universidade
Federal do Pará - UFPA)
Leveraging
Domain-Expert Knowledge in a Genetic Algorithm for Civil Engineering
Design Optimization (Page
1433)
H. Vo, J. Terada, D. Joslin, J. Dragovich (Seattle
University)
Dominance
Learning in Diploid Genetic Algorithms for Dynamic Optimization Problems
(Page 1435)
S. Yang (University of Leicester)
Both
Robust Computation and Mutation Operation in Dynamic Evolutionary Algorithm
are Based on Orthogonal Design
(Page 1437)
S. Zeng, R. Wang, H. Shi, G. Chen (China University
of GeoSciences)
H. de Garis (Utah State University)
L. Kang , L. Ding (Wuhan University)
|
