223 search results - page 15 / 45 » Approximate local search in combinatorial optimization |
AI
1999
Springer
13 years 7 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
In this work, two new techniques for non-linear feature extraction are presented. In these techniques, new features are obtained as radial projections of the original measurements...
HM
2009
Springer
14 years 3 days ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
JCC
2008
13 years 7 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...