Sciweavers

2336 search results - page 156 / 468
» A New Parallel Genetic Algorithm
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 11 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 2 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
NAR
2007
132views more  NAR 2007»
14 years 9 months ago
Expanded protein information at SGD: new pages and proteome browser
The recent explosion in protein data generated from both directed small-scale studies and largescale proteomics efforts has greatly expanded the quantity of available protein info...
Robert S. Nash, Shuai Weng, Benjamin C. Hitz, Rama...
COMPGEOM
2004
ACM
15 years 3 months ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 1 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli