Sciweavers

213 search results - page 8 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
90
Voted
ECMDAFA
2010
Springer
228views Hardware» more  ECMDAFA 2010»
15 years 29 days ago
Example-Based Sequence Diagrams to Colored Petri Nets Transformation Using Heuristic Search
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
Marouane Kessentini, Arbi Bouchoucha, Houari A. Sa...
ICGA
1997
122views Optimization» more  ICGA 1997»
14 years 11 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
73
Voted
ICS
2005
Tsinghua U.
15 years 3 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
PR
2008
131views more  PR 2008»
14 years 9 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...
ANTSW
2004
Springer
15 years 3 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...