466 search results - page 45 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
156
click to vote
KR
2000
Springer
15 years 9 months ago
2000
Springer
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
168
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
161
Voted
DLOG
2007
15 years 8 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
145
click to vote
GFKL
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
214
click to vote
COMGEO
2004
ACM
15 years 5 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...