1550 search results - page 74 / 310 » Optimizing search by showing results in context |
GECCO
2006
Springer
14 years 25 days ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
NIPS
2007
13 years 10 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
GECCO
2006
Springer
14 years 25 days ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...