18 search results - page 3 / 4 » When Do Bounds and Domain Propagation Lead to the Same Searc... |
WEBI
2007
Springer
14 years 2 months ago
2007
Springer
— We propose a hierarchical approach to document categorization that requires no pre-configuration and maps the semantic document space to a predefined taxonomy. The utilizatio...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
DLOG
2007
13 years 11 months ago
2007
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
AIPS
2006
13 years 10 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...