466 search results - page 72 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
149
click to vote
MINAR
1998
Springer
15 years 10 months ago
1998
Springer
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
165
click to vote
ICGI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
197
click to vote
SODA
1993
ACM
15 years 7 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
166
click to vote
JAIR
2000
15 years 5 months ago
2000
A major problem in machine learning is that of inductive bias: how to choose a learner's hypothesis space so that it is large enough to contain a solution to the problem bein...
171
click to vote
ATAL
2009
Springer
16 years 17 days ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...