Sciweavers

455 search results - page 1 / 91
» First Experimental Results of ProbCut Applied to Chess
Sort
View
ACG
2003
Springer
13 years 8 months ago
First Experimental Results of ProbCut Applied to Chess
ProbCut is a selective-search enhancement to the standard alpha
Albert Xin Jiang, Michael Buro
ICDAR
2011
IEEE
12 years 4 months ago
Chinese Chess Character Recognition with Radial Harmonic Fourier Moments
—Radial harmonic Fourier moments (RHFMs) are invariant to translation, rotation, scaling and intensity, which own excellent image description ability, noise-resistant power, and ...
Kejia Wang, Honggang Zhang, Ziliang Ping, Haiying
AAAI
2010
13 years 6 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko
AAAI
2010
13 years 6 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
BMCBI
2011
12 years 11 months ago
Systematic error detection in experimental high-throughput screening
Background: High-throughput screening (HTS) is a key part of the drug discovery process during which thousands of chemical compounds are screened and their activity levels measure...
Plamen Dragiev, Robert Nadon, Vladimir Makarenkov