Sciweavers

1215 search results - page 111 / 243
» Application domain study of evolutionary algorithms in optim...
Sort
View
FASE
2010
Springer
15 years 8 months ago
Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
Mark Harman
ILP
2004
Springer
15 years 6 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
EVOW
2005
Springer
15 years 7 months ago
Developing Fitness Functions for Pleasant Music: Zipf's Law and Interactive Evolution Systems
Abstract. In domains such as music and visual art, where the quality of an individual often depends on subjective or hard to express concepts, the automating fitness assignment bec...
Bill Z. Manaris, Penousal Machado, Clayton McCaule...
COR
2008
122views more  COR 2008»
15 years 1 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
163
Voted
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 1 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon