Sciweavers

406 search results - page 18 / 82
» Identifying Codes and Covering Problems
Sort
View
EC
2008
153views ECommerce» more  EC 2008»
14 years 11 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
TSP
2008
118views more  TSP 2008»
14 years 11 months ago
Maximum-Likelihood Detection of Orthogonal Space-Time Block Coded OFDM in Unknown Block Fading Channels
For orthogonal space-time block coded orthogonal frequency division multiplexing (OSTBC-OFDM) systems, many of the existing blind detection and channel estimation methods rely on t...
Tsung-Hui Chang, Wing-Kin Ma, Chong-Yung Chi
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 5 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
MP
2006
138views more  MP 2006»
14 years 11 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
SGAI
2005
Springer
15 years 5 months ago
Geometric Proportional Analogies In Topographic Maps: Theory and Application
This paper details the application of geometric proportional analogies in the sub-classification of polygons within a topographic (land cover) map. The first part of this paper co...
Emma-Claire Mullally, Diarmuid P. O'Donoghue, Amy ...