1725 search results - page 167 / 345 » Relaxed genetic programming |
100
Voted
ANOR
2005
14 years 10 months ago
2005
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
116
click to vote
COCOS
2003
Springer
15 years 3 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
JCB
2000
14 years 10 months ago
2000
Large scale gene duplication is a major force driving the evolution of genetic functional innovation. Whole genome duplications are widely believed to have played an important rol...
ECOOP
2000
Springer
15 years 2 months ago
2000
Springer
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler’s ability to perform program optimiz...