Sciweavers

1157 search results - page 137 / 232
» Solving iterated functions using genetic programming
Sort
View
135
Voted
AAAI
2012
13 years 6 months ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein
93
Voted
GECCO
2005
Springer
15 years 9 months ago
A new approach to evaluate GP schema in context
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
Hammad Majeed
140
Voted
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
15 years 10 months ago
Mining breast cancer data with XCS
In this paper, we describe the use of a modern learning classifier system to a data mining task. In particular, in collaboration with a medical specialist, we apply XCS to a prima...
Faten Kharbat, Larry Bull, Mohammed Odeh
111
Voted
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
15 years 4 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
144
Voted
JCB
2007
146views more  JCB 2007»
15 years 3 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...