Sciweavers

5331 search results - page 651 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
16 years 1 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
HM
2007
Springer
120views Optimization» more  HM 2007»
16 years 1 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
16 years 11 days ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida
LCTRTS
2005
Springer
16 years 10 days ago
A sample-based cache mapping scheme
Applications running on the StrongARM SA-1110 or XScale processor cores can specify cache mapping for each virtual page to achieve better cache utilization. In this work, we descr...
Rong Xu, Zhiyuan Li
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
16 years 7 days ago
Central Point Crossover for Neuro-genetic Hybrids
In this paper, we consider each neural network as a point in a multi-dimensional problem space and suggest a crossover that locates the central point of a number of neural networks...
Soonchul Jung, Byung Ro Moon