65 search results - page 5 / 13 » The Accuracy of Search Heuristics: An Empirical Study on Kna... |
FLAIRS
2004
13 years 10 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
CP
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
JMLR
2006
13 years 8 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...