Sciweavers

GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 6 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
14 years 6 months ago
Visualizing the search process of particle swarm optimization
It is a hard problem to understand the search process of particle swarm optimization over high-dimensional domain. The visualization depicts the total search process and then it w...
Yong-Hyuk Kim, Kang Hoon Lee, Yourim Yoon
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
14 years 6 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 6 months ago
Insight knowledge in search based software testing
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
Andrea Arcuri
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 6 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
14 years 6 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper
GECCO
2009
Springer
101views Optimization» more  GECCO 2009»
14 years 6 months ago
Modeling UCS as a mixture of experts
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...
Narayanan Unny Edakunni, Tim Kovacs, Gavin Brown, ...
GECCO
2009
Springer
200views Optimization» more  GECCO 2009»
14 years 6 months ago
Optimization of the trading rule in foreign exchange using genetic algorithm
The generation of profitable trading rules for Foreign Exchange (FX) investments is a difficult but popular problem. The use of Machine Learning in this problem allows us to obtai...
Akinori Hirabayashi, Claus de Castro Aranha, Hitos...
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 6 months ago
Application of evolutionary algorithms in detection of SIP based flooding attacks
The Session Initiation Protocol (SIP) is the de facto standard for user’s session control in the next generation Voice over Internet Protocol (VoIP) networks based on the IP Mul...
M. Ali Akbar, Muddassar Farooq