Sciweavers

4430 search results - page 67 / 886
» Solving Optimization Problems with DLL
Sort
View
112
Voted
GECCO
2006
Springer
15 years 6 months ago
MOGE: GP classification problem decomposition using multi-objective optimization
A novel approach to classification is proposed in which a Paretobased ranking of individuals is used to encourage multiple individuals to participate in the solution. To do so, th...
Andrew R. McIntyre, Malcolm I. Heywood
126
Voted
SPIRE
2010
Springer
15 years 1 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
134
Voted
CATA
2004
15 years 4 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
137
Voted
PPSN
2010
Springer
15 years 1 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
124
Voted
SIAMMAX
2010
156views more  SIAMMAX 2010»
14 years 9 months ago
Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints
Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. ...
Roland Herzog, Ekkehard W. Sachs