Sciweavers

804 search results - page 27 / 161
» Solutions to Computational Problems Through Gene Assembly
Sort
View
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 1 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
FLAIRS
2008
13 years 10 months ago
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
Lukás Chrpa, Roman Barták
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 1 months ago
Multipopulation cooperative coevolutionary programming (MCCP) to enhance design innovation
This paper describes the development of an evolutionary algorithm called Multipopulation Cooperative Coevolutionary Programming (MCCP) that extends Genetic Programming (GP) to sea...
Emily M. Zechman, S. Ranji Ranjithan
SC
2005
ACM
14 years 1 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
IEEEMM
2007
146views more  IEEEMM 2007»
13 years 7 months ago
Learning Microarray Gene Expression Data by Hybrid Discriminant Analysis
— Microarray technology offers a high throughput means to study expression networks and gene regulatory networks in cells. The intrinsic nature of high dimensionality and small s...
Yijuan Lu, Qi Tian, Maribel Sanchez, Jennifer L. N...