Sciweavers

1157 search results - page 39 / 232
» Solving iterated functions using genetic programming
Sort
View

Book
270views
16 years 11 months ago
A Field Guide To Genetic Programming
"GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas...
Riccardo Poli, William B. Langdon, Nicholas Freit...
124
Voted
ICML
2008
IEEE
16 years 4 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
147
Voted
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 3 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
110
Voted
BMCBI
2008
90views more  BMCBI 2008»
15 years 3 months ago
Function2Gene: A gene selection tool to increase the power of genetic association studies by utilizing public databases and expe
Background: Many common disorders have multiple genetic components which convey increased susceptibility. SNPs have been used to identify genetic components which are associated w...
Don L. Armstrong, Chaim O. Jacob, Raphael Zidovetz...
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
15 years 10 months ago
Discrete dynamical genetic programming in XCS
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
Richard Preen, Larry Bull