28497 search results - page 397 / 5700 » Improving experiences of computation |
151
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
155
click to vote
ICCBR
2009
Springer
16 years 1 months ago
2009
Springer
Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approac...
159
click to vote
CPAIOR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
168
click to vote
ICTAI
2006
IEEE
16 years 27 days ago
2006
IEEE
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...
170
click to vote
ASPDAC
2006
ACM
16 years 26 days ago
2006
ACM
—Designing high-performance systems with high yield under parameter variations has raised serious design challenges in nanometer technologies. In this paper, we propose a profit-...