86 search results - page 1 / 18 » Pruning Improves Heuristic Search for Cost-Sensitive Learnin... |
ICML
2002
IEEE
14 years 5 months ago
2002
IEEE
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
AI
2002
Springer
13 years 4 months ago
2002
Springer
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
GLVLSI
2009
IEEE
13 years 11 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...