Sciweavers

111 search results - page 3 / 23
» How well do multi-objective evolutionary algorithms scale to...
Sort
View
SAC
2003
ACM
13 years 10 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
JSAC
2006
115views more  JSAC 2006»
13 years 5 months ago
Deployment of an Algorithm for Large-Scale Topology Discovery
Abstract-- Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the p...
Benoit Donnet, Philippe Raoult, Timur Friedman, Ma...
KES
2008
Springer
13 years 5 months ago
Instruction-based development: From evolution to generic structures of digital circuits
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
Michal Bidlo, Jaroslav Skarvada
GECCO
2005
Springer
157views Optimization» more  GECCO 2005»
13 years 10 months ago
Simple addition of ranking method for constrained optimization in evolutionary algorithms
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
Pei Yee Ho, Kazuyuki Shimizu
CMG
2003
13 years 6 months ago
{Performance Modeling and Evaluation of Large-Scale J2EE Applications
The queueing Petri net (QPN) paradigm provides a number of benefits over conventional modeling paradigms such as queueing networks and generalized stochastic Petri nets. Using qu...
Samuel Kounev, Alejandro P. Buchmann