Sciweavers

1026 search results - page 98 / 206
» An Optimal Solution to Room Search Problem
Sort
View
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 12 months ago
An artificial immune network for multimodal function optimization on dynamic environments
Multimodal optimization algorithms inspired by the immune system are generally characterized by a dynamic control of the population size and by diversity maintenance along the sea...
Fabrício Olivetti de França, Fernand...
TSE
2010
132views more  TSE 2010»
15 years 1 months ago
ASCENT: An Algorithmic Technique for Designing Hardware and Software in Tandem
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...
Jules White, Brian Doughtery, Douglas C. Schmidt
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 27 days 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
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
16 years 14 days ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 12 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan