418 search results - page 26 / 84 » Query Optimization by Simulated Annealing |
CLUSTER
2008
IEEE
14 years 2 months ago
2008
IEEE
—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...
IJCSA
2007
13 years 7 months ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
ICTAI
2000
IEEE
14 years 10 days ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
DGCI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Discrete tomography concerns the reconstruction of functions with a finite number of values from few projections. For a number of important real-world problems, this tomo...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...