Results 31 to 40 of about 520,046 (284)

Sistem Informasi Troubleshooting Pada Personal Computer (PC)

Ilkom Jurnal Ilmiah, 2016
Penelitian ini bertujuan membangun sebuah perangkat lunak sistem informasi untuk menangani troubleshooting computer. Metode yang digunakan adalah Binary tree, yaitu sebuah tree dengan syarat bahwa tiap node hanya boleh memiliki maksimal 2 subtree yang ...
Ari Widiastono, Nur Ain Banyal, Liza Angriani   +2 more
doaj   +1 more source

On Succinct Representations of Binary Trees [PDF]

Mathematics in Computer Science, 2017
Journal version of part of COCOON 2012 ...
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti   +2 more
openaire   +3 more sources

Holonomic equations and efficient random generation of binary trees [PDF]

Discrete Mathematics & Theoretical Computer Science
Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj   +1 more source

Combining Binary Search Trees [PDF]

, 2013
12 pages, 2 figures, ICALP ...
Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan   +3 more
openaire   +6 more sources

On binary decision hypertree (hyperdiagram) [PDF]

AUT Journal of Mathematics and Computing
In computer science, a binary decision diagram is a data structure that is used to represent a Boolean function and to consider a compressed representation of relations.
Mohammad Hamidi, Marzieh Rahmati
doaj   +1 more source

Left and right length of paths in binary trees or on a question of Knuth [PDF]

Discrete Mathematics & Theoretical Computer Science, 2006
We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$.
Alois Panholzer
doaj   +1 more source

Binary Tree Blockchain of Decomposed Transactions [PDF]

Journal of Universal Computer Science
Widespread adoption of blockchain technologies requires scalability. To achieve scalability, various methods are applied, including new consensus algorithms, directed acyclic graph solutions, sharding solutions, and off-chain solutions.
Davut Çulha
doaj   +3 more sources

Tree cumulants and the geometry of binary tree models [PDF]

, 2012
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved.
Smith, Jim Q., Zwiernik, Piotr
core   +1 more source

Toric ideals of homogeneous phylogenetic models

, 2004
We consider the phylogenetic tree model in which every node of the tree is observed and binary and the transitions are given by the same matrix on each edge of the tree.
Eriksson, Nicholas
core   +2 more sources

Neighborhoods of trees in circular orderings [PDF]

, 2015
In phylogenetics, a common strategy used to construct an evolutionary tree for a set of species X is to search in the space of all such trees for one that optimizes some given score function (such as the minimum evolution, parsimony or likelihood score).
Andreas Spillner, B Allen, C Semple, C Semple, D Bryant, D Bryant, D Bryant, D Robinson, D Robinson, D Sleator, E Tepe, F Luccio, J De Loera, J Felsenstein, K Gordon, L Kubatko, L Pournin, M Li, MJ Sanderson, MS Bansal, P Humphries, P Lemey, R Desper, R Jamison, S Bastkowski, S Cleary, S Whelan, Sarah Baskowski, Taoyang Wu, Vincent Moulton, Y Ding   +30 more
core   +1 more source