5 search results - page 1 / 1 » Exploiting weak dependencies in tree-based search |
SAC
2009
ACM
13 years 11 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
IPMI
2003
Springer
14 years 5 months ago
2003
Springer
We formulate and interpret several registration methods in the context of a unified statistical and information theoretic framework. A unified interpretation clarifies the implici...
AI
2003
Springer
13 years 10 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
PDIS
1996
IEEE
13 years 8 months ago
1996
IEEE
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...