Search Results - Finite tree algorithm

A hybrid approach to joint spectral radius computation by Mejstrik, Thomas, Reif, Ulrich

“… Our algorithm aims at constructing a finite set-valued tree according to the approach of Möller and Reif using a norm that is constructed in the spirit of the invariant polytope algorithm…”
Get full text

Canonical tree-decompositions of finite graphs I. Existence and algorithms by Carmesin, J., Diestel, R., Hamann, M., Hundertmark, F.

“…We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k…”
Get full text

A contact searching algorithm including bounding volume trees applied to finite sliding mortar formulations by Yang, Bin, Laursen, Tod A.

“… In this algorithm, a bounding volume hierarchy, defined in the context of a binary tree, is built for each contact surface based on the geometry of the surface…”
Get full text

A Tree Algorithm for Isotropic Finite Elements on the Sphere by Bauer, Frank, Freeden, Willi, Schreiner, Michael

“… In this paper, we deal with isotropic kernel functions showing a local support (briefly called isotropic finite elements…”
Get full text

A local predictive convection-diffusion refinement indicator for the Tri-Tree adapted finite element multigrid algorithm of the Navier-Stokes equations by Wille, S.Ø.

“… The multigrid is generated by the Tri-Tree algorithm. The solution of the Navier-Stokes equations is first found for a low Reynolds number for a coarse grid…”
Get full text

Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees by Mikhail Abramyan, Boris Melnikov

“…In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism…”
Get full text

Error estimates for a tree structure algorithm solving finite horizon control problems by Saluzzi, Luca, Alla, Alessandro, Falcone, Maurizio

“… Here we analyze a dynamic programming algorithm based on a tree structure. The tree is built by the time discrete dynamics avoiding in this way the use of a fixed…”
Get full text

A Tri-Tree multigrid recoarsement algorithm for the finite element formulation of the Navier-Stokes equations by Wille, S.Ø.

“… The recoarsement algorithm is based on the hierarchic Tri-Tree multigrid generation algorithm and computes a local Tri-Tree Element Reynolds number…”
Get full text

Forward linearised tree pattern matching using tree pattern border array by Trávníček, Jan, Pecka, Tomáš, Obůrka, Robin, Janoušek, Jan

“… We consider tree patterns with node wildcards and subtree wildcards. Then we use the tree pattern border array in a new forward tree pattern matching algorithm for ordered ranked trees…”
Get full text

ALGORITHM DESIGN AND IMPLEMENTATION OF FINITE WAVELET GROW TREE by Liu, Qi, Lü, Shuwang, Pan, Hong, Wang, Cuiping

“…Based on grow tree composite model, Finite Field Wavelet Grow Tree （FW-GT） was proposed in this paper…”
Get full text

Sofic Tree-Shifts by Aubrun, Nathalie, Béal, Marie-Pierre

“…We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite ranked trees accepted by finite tree automata…”
Get full text

A randomised inference algorithm for regular tree languages by Hogberg, Johanna

“…We present a randomised inference algorithm for regular tree languages. The algorithm takes as input two disjoint finite nonempty sets of trees and and outputs…”
Get full text

INDUCTIVE ALGORITHMS ON FINITE TREES by Becker, Ronald I

“…Many algorithms for calculating graph theoretic quantities on trees rely implicitly on an inductive procedure for calculating a certain function defined on the vertices of the tree, after which the…”
Get full text

Bounded-Diameter Tree-Decompositions by Berger, Eli, Seymour, Paul

“…? For finite graphs, this is a property of interest in algorithmic graph theory, where it is called having bounded “tree-length…”
Get full text

Performance Analysis of Finite Nonhomogeneous Population Tree Conflict Resolution Algorithms Using Constant Size Window Access by Polyzos, G., Molle, M., Venetsanopoulos, A.

“…Multiple-access protocols control access to a broadcast communication channel. Tree conflict resolution algorithms are the heart of some distributed multiple…”
Get full text

A context tree weighting algorithm with a finite window by Sakaguchi, Hiroaki, Kawabata, Tsutomu

“… been investigated. A compression algorithm with a forgetting mechanism and with a finite window (FWCTW method) is proposed. As the first step, the CTW method in general is discussed…”
Get full text

Non-probabilistic method to consider uncertainties in structural damage identification based on Hybrid Jaya and Tree Seeds Algorithm by Ding, Zhenghao, Li, Jun, Hao, Hong

“… This paper proposes a novel non-probabilistic structural damage identification approach by developing a hybrid swarm intelligence technique based on Jaya and Tree Seeds Algorithm (TSA…”
Get full text

Deterministic rendezvous in infinite trees by Bhagat, Subhash, Pelc, Andrzej

Get full text

An efficient DP algorithm on a tree-structure for finite horizon optimal control problems by Alla, Alessandro, Falcone, Maurizio, Saluzzi, Luca

“…The classical Dynamic Programming (DP) approach to optimal control problems is based on the characterization of the value function as the unique viscosity…”
Get full text

Structural damage identification with uncertain modelling error and measurement noise by clustering based tree seeds algorithm by Ding, Zhenghao, Li, Jun, Hao, Hong, Lu, Zhong-Rong

“… This paper proposes a novel structural damage identification approach by using the clustering based Tree Seeds Algorithm, termed as C-TSA, taking into account of both the finite element modeling…”
Get full text