466 search results - page 43 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
171
click to vote
JCO
2010
15 years 4 months ago
2010
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
177
click to vote
WEA
2007
Springer
16 years 5 days ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
157
click to vote
PLILP
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
152
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...