86 search results - page 4 / 18 » Pruning Improves Heuristic Search for Cost-Sensitive Learnin... |
COR
2010
13 years 7 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
MM
2006
ACM
14 years 1 months ago
2006
ACM
Salient points are locations in an image where there is a significant variation with respect to a chosen image feature. Since the set of salient points in an image capture import...
ECAI
2000
Springer
13 years 12 months ago
2000
Springer
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
ICDCSW
2006
IEEE
14 years 1 months ago
2006
IEEE
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...