1142 search results - page 56 / 229 » Set Variables and Local Search |
VMCAI
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
AUSAI
2004
Springer
14 years 3 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
CONSTRAINTS
2007
13 years 10 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
EUSFLAT
2009
13 years 7 months ago
2009
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
AAAI
1994
13 years 11 months ago
1994
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...