1813 search results - page 25 / 363 » Instance Pruning Techniques |
DDECS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Due to ever increasing design sizes more efficient tools for Automatic Test Pattern Generation (ATPG) are needed. Recently ATPG based on Boolean satisfiability (SAT) has been ...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic pol...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...
114
Voted
WISE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
EMNLP
2007
15 years 1 months ago
2007
In this paper we propose an instance based method for lexical entailment and apply it to automatic ontology population from text. The approach is fully unsupervised and based on k...