466 search results - page 88 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
117
Voted
EWCBR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
AAAI
2006
14 years 11 months ago
2006
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...
100
click to vote
ALENEX
2009
14 years 10 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
105
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...