Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,786,915 papers from all fields of science
Search
Sign In
Create Free Account
Alpha–beta pruning
Known as:
Alphabeta pruning
, Alpha-beta search
, A-b pruning
Expand
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
18 relations
AlphaGo
Branch and bound
Branching factor
Combinatorial optimization
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
To prune, or not to prune: exploring the efficacy of pruning for model compression
Michael Zhu
,
Suyog Gupta
ICLR
2018
Corpus ID: 27494814
Model pruning seeks to induce sparsity in a deep neural network's various connection matrices, thereby reducing the number of…
Expand
Highly Cited
2017
Highly Cited
2017
Learning Efficient Convolutional Networks through Network Slimming
Zhuang Liu
,
Jianguo Li
,
Zhiqiang Shen
,
Gao Huang
,
Shoumeng Yan
,
Changshui Zhang
IEEE International Conference on Computer Vision…
2017
Corpus ID: 5993328
The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high…
Expand
Highly Cited
2017
Highly Cited
2017
Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
D. Silver
,
T. Hubert
,
+10 authors
D. Hassabis
ArXiv
2017
Corpus ID: 33081038
The game of chess is the most widely-studied domain in the history of artificial intelligence. The strongest programs are based…
Expand
Highly Cited
2017
Highly Cited
2017
Structured Pruning of Deep Convolutional Neural Networks
S. Anwar
,
Kyuyeon Hwang
,
Wonyong Sung
ACM J. Emerg. Technol. Comput. Syst.
2017
Corpus ID: 7333079
Real-time application of deep learning algorithms is often hindered by high computational complexity and frequent memory accesses…
Expand
Highly Cited
2007
Highly Cited
2007
Efficient WFST-Based One-Pass Decoding With On-The-Fly Hypothesis Rescoring in Extremely Large Vocabulary Continuous Speech Recognition
Takaaki Hori
,
Chiori Hori
,
Y. Minami
,
A. Nakamura
IEEE Transactions on Audio, Speech, and Language…
2007
Corpus ID: 15002505
This paper proposes a novel one-pass search algorithm with on-the-fly composition of weighted finite-state transducers (WFSTs…
Expand
Highly Cited
2006
Highly Cited
2006
Bandit Based Monte-Carlo Planning
Levente Kocsis
,
Csaba Szepesvari
ECML
2006
Corpus ID: 15184765
For large state-space Markovian Decision Problems Monte-Carlo planning is one of the few viable approaches to find near-optimal…
Expand
Highly Cited
1997
Highly Cited
1997
Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
A. Cassandra
,
M. Littman
,
N. Zhang
UAI
1997
Corpus ID: 1765539
Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in…
Expand
Highly Cited
1996
Highly Cited
1996
A fast distributed algorithm for mining association rules
D. Cheung
,
Jiawei Han
,
V. Ng
,
A. Fu
,
Yongjian Fu
Fourth International Conference on Parallel and…
1996
Corpus ID: 861285
With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems…
Expand
Highly Cited
1987
Highly Cited
1987
Logical foundations of artificial intelligence
M. Genesereth
,
N. Nilsson
1987
Corpus ID: 29423399
Highly Cited
1975
Highly Cited
1975
An Analysis of Alpha-Beta Pruning
D. Knuth
,
Ronald W. Moore
Artif. Intell.
1975
Corpus ID: 28918417
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE