3 search results - page 1 / 1 » Strengthening Landmark Heuristics via Hitting Sets |
73
Voted
ECAI
2010
Springer
15 years 1 days ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
88
Voted
CLEF
2010
Springer
15 years 1 days ago
2010
Springer
We present our hybrid system for the PAN challenge at CLEF 2010. Our system performs plagiarism detection for translated and non-translated externally as well as intrinsically plag...
88
Voted
ADC
2003
Springer
15 years 4 months ago
2003
Springer
Defeasible logic is a non-monotonic logic with applications in rule-based domains such as law. To ease the development and improve the accuracy of expert systems based on defeasib...