2313 search results - page 60 / 463 » On Heuristic Time Hierarchies |
160
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
186
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
140
click to vote
AAAI
2010
15 years 7 months ago
2010
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
352
click to vote
GECCO
2011
Springer
14 years 9 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
239
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...