Sciweavers

158 search results - page 8 / 32
» On Complexity of Optimal Recombination for Binary Representa...
Sort
View
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
13 years 11 months ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin
CP
1998
Springer
13 years 12 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 11 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
AIR
1998
103views more  AIR 1998»
13 years 7 months ago
Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis
Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc...
Francisco Herrera, Manuel Lozano, José L. V...