Sciweavers

213 search results - page 10 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
SAC
2004
ACM
15 years 4 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
ICML
2005
IEEE
16 years 1 days ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
EOR
2008
200views more  EOR 2008»
14 years 11 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
IWINAC
2007
Springer
15 years 5 months ago
Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
Jhon Edgar Amaya, Carlos Cotta, Antonio J. Fern&aa...
EVOW
2004
Springer
15 years 4 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
Carlos Cotta