466 search results - page 58 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
188
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
170
click to vote
IJCAI
2007
15 years 7 months ago
2007
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
178
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
191
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
174
click to vote
CVPR
2007
IEEE
16 years 13 days ago
2007
IEEE
In building a face recognition system for real-life scenarios, one usually faces the problem that is the selection of a feature-space and preprocessing methods such as alignment u...