1603 search results - page 74 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
156
click to vote
ISCAS
2006
IEEE
16 years 9 days ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
146
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
160
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
190
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper presents an updated version of the adaptive learning particle swarm optimizer (ALPSO) [6], we call it ALPSO-II. In order to improve the performance of ALPSO on multi-mod...
145
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...