1013 search results - page 46 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
CP
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
ROBOCUP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper presents a new approach to optimize gait parameter sets using evolutionary algorithms. It separates the crossover-step of the evolutionary algorithm into an in...
EMO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
IR
2010
14 years 8 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...