Sciweavers

4491 search results - page 197 / 899
» Algorithm Engineering
Sort
View
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 8 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
110
Voted
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
15 years 8 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
122
Voted
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 8 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth
116
Voted
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
16 years 2 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
COMPSAC
2009
IEEE
15 years 5 months ago
Practical Extensions of a Randomized Testing Tool
—Many efficient random testing algorithms for object-oriented software have been proposed due to their simplicity and reasonable code coverage; however, even the stateof-the-art...
Hojun Jaygarl, Carl K. Chang, Sunghun Kim