91 search results - page 15 / 19 » Information-theoretic approaches to branching in search |
CP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
DLOG
2007
14 years 11 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...
AIPS
2008
14 years 11 months ago
2008
This paper reports our experience extending an on-line printer controller based on AI planning to handle two significant features of this commercially important domain: execution ...
CP
2008
Springer
14 years 11 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
SIGIR
2004
ACM
15 years 2 months ago
2004
ACM
In this paper, we introduce an information theoretic method for estimating the usefulness of the hyperlink structure induced from the set of retrieved documents. We evaluate the e...