Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,732,007 papers from all fields of science
Search
Sign In
Create Free Account
Binary expression tree
Known as:
Expression tree
A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expression…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Binary tree
Boolean algebra
Context-free grammar
Parallel Tree Contraction
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Multi-objective Gene Expression Programming Based Automatic Clustering Method
Ruochen Liu
,
Jianxia Li
,
Manman He
International Symposium on Intelligence…
2017
Corpus ID: 69681679
We have proposed multi-objective Gene Expression Programming (GEP) based automatic clustering method (do not need prior knowledge…
Expand
2017
2017
VMEXT: A Visualization Tool for Mathematical Expression Trees
M. Schubotz
,
Norman Meuschke
,
Thomas Hepp
,
H. Cohl
,
Bela Gipp
International Conference on Intelligent Computer…
2017
Corpus ID: 4852539
Mathematical expressions can be represented as a tree consisting of terminal symbols, such as identifiers or numbers (leaf nodes…
Expand
2013
2013
Towards Automated Program Abstraction and Language Enrichment
Sergej Chodarev
,
E. Pietriková
,
J. Kollár
Slate
2013
Corpus ID: 18054559
This paper focuses on the presentation of a method for automated raise of programming language abstraction level. The base…
Expand
2013
2013
Partial-match Retrieval with Structure-reflected Indices at the NTCIR-10 Math Task
H. Hagino
,
Hiroaki Saito
NTCIR Conference on Evaluation of Information…
2013
Corpus ID: 39982064
To attain fast and accurate response in math formulae search, an index should be prepared which holds structure information of…
Expand
2010
2010
Speculatively Redundant Continued Logarithm Representation
T. Brabec
IEEE transactions on computers
2010
Corpus ID: 23312137
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application…
Expand
2010
2010
On union-complexity of regular languages
B. Nagy
International Symposium on Computational…
2010
Corpus ID: 18722656
Regular expressions can be represented by expression tree and by flow diagram (syntax graph). Based on equivalences a possible…
Expand
2010
2010
Global solutions of well-constrained transcendental systems using expression trees and a single solution test
M. Aizenshtein
,
M. Bartoň
,
G. Elber
Computer Aided Geometric Design
2010
Corpus ID: 14796439
2010
2010
Reduced-GEP: Improving Gene Expression Programming by Gene Reduction
Yu Chen
,
Chang-jie Tang
,
Rui Li
,
Mingfang Zhu
,
Chuan Li
,
J. Zuo
Second International Conference on Intelligent…
2010
Corpus ID: 16219222
In traditional Gene Expression Programming (GEP), each chromosome is expressed and evaluated on the Expression Tree (ET). The ET…
Expand
2002
2002
Code compression techniques using operand field remapping
K. Lin
,
C. Chung
2002
Corpus ID: 55027320
Dictionary-based code compression stores the most frequently used instruction sequences in a dictionary and replaces the…
Expand
1999
1999
Design of a superscalar processor based on queue machine computation model
S. Okamoto
,
H. Suzuki
,
A. Maeda
,
M. Sowa
IEEE Pacific Rim Conference on Communications…
1999
Corpus ID: 58519365
The queue machine computation model is an evaluation scheme for expression trees, in which the input operands of operations are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE