Suchergebnisse - "loopless algorithm"

A loopless algorithm for generating (k, m)-ary trees in Gray code order von Chang, Yu-Hsuan, Wu, Ro-Yu, Lin, Cheng-Kuan, Chang, Jou-Ming

“… In this paper, we propose a loopless algorithm to generate all such Z-sequences in Gray code order …”
Volltext

A loopless algorithm for generating multiple binary tree sequences simultaneously von Wu, Ro-Yu, Chang, Jou-Ming, Chan, Hung-Chang, Pai, Kung-Jui

“… ) and right-child sequences (RC-sequences). Next, we propose a loopless algorithm associated with rotations of binary trees for generating LW-, RW-, LC-, and RC-sequences simultaneously …”
Volltext

Gray Codes, Loopless Algorithm and Partitions von Mansour, Toufik, Nassar, Ghalib

“… Also, we construct a different loopless algorithm for generating the set of all partitions of [ n ] which gives a constant time between successive partitions in the construction process …”
Volltext

A loopless algorithm for generating the permutations of a multiset von Vajnovszki, Vincent

“… Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a …”
Volltext

Loopless Variance Reduced Stochastic ADMM for Equality Constrained Problems in IoT Applications von Liu, Yuanyuan, Geng, Jiacheng, Shang, Fanhua, An, Weixin, Liu, Hongying, Zhu, Qi

“… The alternating direction method of multipliers (ADMMs) is an efficient optimization method for solving equality constrained problems in Internet of Things …”
Volltext

The coolest way to generate combinations von Ruskey, Frank, Williams, Aaron

“… We present a practical and elegant method for generating all ( s , t ) -combinations (binary strings with s zeros and t ones): Identify the shortest prefix …”
Volltext

A Loopless Algorithm for Generation of Basic Minimal Interval Orders von LaFollette, Paul S., Korsh, James F.

Volltext

Loopless Generation of Linear Extensions of a Poset von Korsh, James F., LaFollette, Paul S.

Volltext

Loopless algorithms to generate maximum length gray cycles wrt. k-character substitutions von Néraud, Jean

“… Given a binary word relation τ onto A⁎ and a finite language X⊆A⁎, a τ-Gray cycle over X consists in a permutation (w[i])0≤i≤|X|−1 of X such that each word …”
Volltext

A loopless approach for constructing a fastest algorithm for the towers of hanoi problem von Er, M.C.

“… A loopless algorithm for the Towers of Hanoi problem is formulated. This algorithm moves each disc in a constant time, independent of the number of discs …”
Volltext

Loopless Algorithms And SchrÖder Trees von Korsh, James, Lafollette, Paul, Lipschutz, Seymour

“… The development of loopless algorithms for such generation has been of more recent concern. This paper is an introduction to the idea and development of loopless algorithms …”
Volltext

Faster search by lackadaisical quantum walk von Wong, Thomas G.

“… ) steps, thus yielding an O ( log N ) improvement over the typical, loopless algorithm. This improved runtime matches the best known quantum algorithms for this search problem …”
Volltext

Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution von Néraud, Jean

“… Given a binary word relation \(\tau\) onto A * and a finite language X \(\subseteq\) A * , a \(\tau\)-Gray cycle over X consists in a permutation w [i] …”
Volltext

Gray Codes Loopless Algorithms and Combinatorics von Nassar, Ghalib, נסאר, גליב

“… Designing Gray codes and Loopless algorithms for combinatorial families is an interesting issue due to their applications in other fields in Computer Science …”
Volltext

Universality class for loopless invasion percolation models and a percolation avalanche burst model for hydraulic fracturing von Ortez, Ronaldo, Rundle, John B, Turcotte, Donald L

“… Here we describe a loopless algorithm on random lattices, coupled with an avalanche-based model for bursts …”
Weitere Angaben

Cool-lex order and k-ary Catalan structures von Durocher, Stephane, Li, Pak Ching, Mondal, Debajyoti, Ruskey, Frank, Williams, Aaron

“… In particular, we provide loopless algorithms that generate each successive object in O(1) time. The algorithms are also efficient in terms of memory, with the k-ary Dyck word algorithm using O …”
Volltext

Amortized efficiency of generating planar paths in convex position von Wu, Ro-Yu, Chang, Jou-Ming, Pai, Kung-Jui, Wang, Yue-Li

“… In this paper, we provide efficient algorithms to generate all planar paths. With the help of a loopless algorithm to produce a set of 2-way binary-reflected Gray codes …”
Volltext

The Coolest Way to Generate Binary Strings von Stevens, Brett, Williams, Aaron

“… First, we give a loopless algorithm …”
Volltext

Efficient loopless generation of Gray codes for k-ary trees von Xiang, Limin, Ushijima, Kazuo, Tang, Changjie

“… Vajnovszki recently developed a loopless algorithm to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless algorithm to generate Gray codes for k-ary trees …”
Volltext

On the central levels problem von Gregor, Petr, Mička, Ondřej, Mütze, Torsten

“… The central levels problem asserts that the subgraph of the (2m+1)-dimensional hypercube induced by all bitstrings with at least m+1−ℓ many 1s and at most m+ℓ …”
Volltext