1725 search results - page 145 / 345 » Relaxed genetic programming |
CPAIOR
2006
Springer
15 years 2 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
104
click to vote
SODA
2003
ACM
15 years 4 days ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
100
click to vote
IFIP
2001
Springer
15 years 3 months ago
2001
Springer
: One of the most important problems in SOC platforms design is that of defining strategies for tuning the parameters of a parameterized system so as to obtain the Pareto-optimal s...
CPHYSICS
2006
14 years 10 months ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
113
click to vote
IPCO
2008
15 years 6 days ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...