Sciweavers

44 search results - page 1 / 9
» Verified Null-Move Pruning
Sort
View
63
Voted
CORR
2008
Springer
78views Education» more  CORR 2008»
14 years 10 months ago
Verified Null-Move Pruning
In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever th...
Omid David-Tabibi, Nathan S. Netanyahu
72
Voted
CG
2008
Springer
15 years 7 days ago
Extended Null-Move Reductions
Abstract. In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conve...
Omid David-Tabibi, Nathan S. Netanyahu
75
Voted
SIGSOFT
2009
ACM
15 years 11 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
95
Voted
CVPR
2007
IEEE
16 years 8 days ago
Using Segmentation to Verify Object Hypotheses
We present an approach for object recognition that combines detection and segmentation within a efficient hypothesize/test framework. Scanning-window template classifiers are the ...
Deva Ramanan
64
Voted
KDD
1994
ACM
140views Data Mining» more  KDD 1994»
15 years 2 months ago
A Comparison of Pruning Methods for Relational Concept Learning
Pre-Pruning and Post-Pruning are two standard methods of dealing with noise in concept learning. Pre-Pruning methods are very efficient, while Post-Pruning methods typically are m...
Johannes Fürnkranz