126 search results - page 6 / 26 » Improving heuristic mini-max search by supervised learning |
ECAI
2000
Springer
13 years 11 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 ...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
JIIS
2007
13 years 7 months ago
2007
The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repositories ...