91 search results - page 2 / 19 » Information-theoretic approaches to branching in search |
ICDM
2003
IEEE
13 years 10 months ago
2003
IEEE
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
AAAI
2008
13 years 7 months ago
2008
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
PKDD
2009
Springer
13 years 12 months ago
2009
Springer
We consider causally sufficient acyclic causal models in which the relationship among the variables is nonlinear while disturbances have linear effects, and show that three princi...
CORR
2011
Springer
13 years 12 days ago
2011
Springer
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...