Sciweavers

213 search results - page 1 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
CLUSTER
2008
IEEE
13 years 11 months ago
A comparison of search heuristics for empirical code optimization
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
Keith Seymour, Haihang You, Jack Dongarra
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
13 years 10 months ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
ITSL
2008
13 years 6 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
AIPS
2009
13 years 6 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
CC
2003
Springer
126views System Software» more  CC 2003»
13 years 10 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers