466 search results - page 35 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
AAAI
2006
15 years 1 months ago
2006
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
CP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
UAI
2000
15 years 1 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
171
click to vote
ICDE
1998
IEEE
16 years 1 months ago
1998
IEEE
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
117
click to vote
SSDBM
1999
IEEE
15 years 4 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...