1639 search results - page 6 / 328 » Anytime Heuristic Search |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
AI
1998
Springer
13 years 7 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
ESOA
2006
13 years 11 months ago
2006
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
DSOM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We investigate the problem of ensuring and maximizing performance guarantees for applications suering software aging. Our focus is the optimization of the minimum and av...
HEURISTICS
2010
13 years 4 months ago
2010
