1632 search results - page 170 / 327 » Sublinear Time Algorithms for Metric Space Problems |
127
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
Adoption of advanced automated SE (ASE) tools would be favored if a business case could be made that these tools are more valuable than alternate methods. In theory, software pred...
139
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
132
click to vote
CSB
2004
IEEE
15 years 8 months ago
2004
IEEE
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
132
Voted
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
141
click to vote
PSTV
1993
15 years 5 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...