Výsledky vyhledávání - Non-binary tree traversal
-
1
A Simple Lossless Algorithm for on-board Satellite Hyperspectral Data Compression
ISSN: 1545-598X, 1558-0571Vydáno: Piscataway IEEE 01.01.2023Vydáno v IEEE geoscience and remote sensing letters (01.01.2023)“…, is computationally less complex. Concept of non-binary tree traversal is used with nearest neighbor method and implemented using neighbor driven decision making in pre-processing stage…”
Získat plný text
Journal Article -
2
Unified formal derivation and automatic verification of three binary-tree traversal non-recursive algorithms
ISSN: 1386-7857, 1573-7543Vydáno: New York Springer US 01.12.2016Vydáno v Cluster computing (01.12.2016)“… and Dijkstra’s weakness precondition theory, and have manually derived and verified binary tree traversal non-recursive algorithms in our previous work…”
Získat plný text
Journal Article -
3
Automatic search model of railway shunting route based on improved artificial neural network algorithm
ISSN: 2731-0809, 2731-0809Vydáno: Cham Springer International Publishing 01.12.2025Vydáno v Discover Artificial Intelligence (01.12.2025)“… The search process is optimized using a binary tree structure that capitalizes on the structural similarity between station areas and binary trees, transforming route searches into binary tree traversal operations…”
Získat plný text
Journal Article -
4
Non-recursive Algorithm Derivation and Formal Proof of Binary Tree Traversal Class Problems
Vydáno: IEEE 01.12.2020Vydáno v 2020 IEEE 20th International Conference on Software Quality, Reliability and Security Companion (QRS-C) (01.12.2020)“… The paper studies the derivation and formal proof of binary tree traversal class non-recursive algorithm…”
Získat plný text
Konferenční příspěvek -
5
A new non-recursive algorithm for binary search tree traversal
ISBN: 0780381637, 9780780381636“… The in-order traversal of a binary search tree is important in searching algorithms, operating systems, and compiler design…”Vydáno: IEEE 2003
Získat plný text
Konferenční příspěvek -
6
STR3: A path-optimal filtering algorithm for table constraints
ISSN: 0004-3702, 1872-7921Vydáno: Elsevier B.V 01.03.2015Vydáno v Artificial intelligence (01.03.2015)“…Constraint propagation is a key to the success of Constraint Programming (CP). The principle is that filtering algorithms associated with constraints are…”
Získat plný text
Journal Article -
7
A New Non-recursive Algorithm for Reconstructing a Binary Tree from its Traversals
ISBN: 1424480930, 9781424480937Vydáno: IEEE 01.10.2010Vydáno v 2010 International Conference on Advances in Recent Technologies in Communication and Computing (01.10.2010)“…This paper presents a new non-recursive algorithm for reconstructing a binary tree from its traversals…”
Získat plný text
Konferenční příspěvek -
8
COSPEDTree: COuplet Supertree by Equivalence Partitioning of Taxa Set and DAG Formation
ISSN: 1545-5963, 1557-9964Vydáno: United States IEEE 01.05.2015Vydáno v IEEE/ACM transactions on computational biology and bioinformatics (01.05.2015)“…From a set of phylogenetic trees with overlapping taxa set, a supertree exhibits evolutionary relationships among all input taxa…”
Získat plný text
Journal Article -
9
Mining high utility itemsets by dynamically pruning the tree structure
ISSN: 0924-669X, 1573-7497Vydáno: Boston Springer US 01.01.2014Vydáno v Applied intelligence (Dordrecht, Netherlands) (01.01.2014)“…Mining high utility itemsets is one of the most important research issues in data mining owing to its ability to consider nonbinary frequency values of items in transactions and different profit values for each item…”
Získat plný text
Journal Article -
10
Mining High Utility Web Access Sequences in Dynamic Web Log Data
ISBN: 9781424474226, 1424474221Vydáno: IEEE 01.06.2010Vydáno v 2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (01.06.2010)“… By considering non-binary occurrences of web pages as internal utilities in web access sequences, e.g…”
Získat plný text
Konferenční příspěvek -
11
Generalized Planning with Procedural Domain Control Knowledge
ISSN: 2334-0835, 2334-0843Vydáno: 01.01.2016Vydáno v Proceedings of the International Conference on Automated Planning and Scheduling (01.01.2016)“…Generalized planning is the task of generating a single solution that is valid for a set of planning problems. In this paper we show how to represent and…”
Získat plný text
Journal Article -
12
On the generation of binary trees from (0-1) codes
ISSN: 0020-7160, 1029-0265Vydáno: Abingdon Gordon and Breach Science Publishers 01.01.1998Vydáno v International journal of computer mathematics (01.01.1998)“… This scheme encodes the non-null links of a binary tree by 1's and the null links by 0's in a pre-order traversal…”
Získat plný text
Journal Article -
13
Generalized Planning With Procedural Domain Control Knowledge
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 11.10.2019Vydáno v arXiv.org (11.10.2019)“…Generalized planning is the task of generating a single solution that is valid for a set of planning problems. In this paper we show how to represent and…”
Získat plný text
Paper

