22 search results - page 2 / 5 » Incremental Breakout Algorithm with Variable Ordering |
ICML
1990
IEEE
13 years 9 months ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
AI
2006
Springer
13 years 5 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
ASPDAC
2005
ACM
13 years 7 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
IROS
2007
IEEE
13 years 12 months ago
2007
IEEE
Abstract— Vision-based place recognition is a desirable feature for an autonomous mobile system. In order to work in realistic scenarios, visual recognition algorithms should be ...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...