561 search results - page 19 / 113 » An empirical analysis of the FixCache algorithm |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
CP
2007
Springer
14 years 1 months ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The Negative Slope Coefficient (nsc) is an empirical measure of problem hardness based on the analysis of offspring-fitness vs. parent-fitness scatterplots. The nsc has been teste...