Sciweavers

2407 search results - page 46 / 482
» The evolutionary forest algorithm
Sort
View
TAMC
2010
Springer
14 years 8 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
CEC
2010
IEEE
14 years 8 months ago
A novel hybrid evolutionary strategy and its periodization with multi-objective genetic optimizers
— This work investigates the effects of the periodization of local and global multi-objective search algorithms. To this, we introduce a model for periodization and define a new...
Paul Kaufmann, Tobias Knieper, Marco Platzner
BIBE
2008
IEEE
15 years 4 months ago
Robust parameter identification for biological circuit calibration
Abstract-The aim of this work is to compare some deterministic optimization algorithms and evolutionary algorithms on parameter estimation in a biological circuit design problem: t...
Giuseppe Nicosia, Eva Sciacca
74
Voted
LATIN
2010
Springer
15 years 2 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
TEC
2008
98views more  TEC 2008»
14 years 9 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...