Sciweavers

1477 search results - page 111 / 296
» Random Convex Programs
Sort
View
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
14 years 1 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert

Book
270views
15 years 4 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...
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
14 years 9 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 7 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
ICML
2009
IEEE
14 years 9 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever