Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Yuli Ye"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 27-37 (2010)
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients. Formulas for
Externí odkaz:
https://doaj.org/article/5b3d3825fd3d46f786c0c86851563e60
Publikováno v:
SSRN Electronic Journal.
Publikováno v:
SSRN Electronic Journal.
Autor:
Allan Borodin, Yuli Ye
Publikováno v:
ACM Transactions on Algorithms. 8:1-23
In this article we study graphs with inductive neighborhood properties. Let P be a graph property, a graph G = ( V, E ) with n vertices is said to have an inductive neighborhood property with respect to P if there is an ordering of vertices v 1 , …
Publikováno v:
Rekayasa Mesin, Vol 13, Iss 2, Pp 487-502 (2022)
Plants grown in pots continue to grow year after year. A flower pot support or flower pot stand is required to add aesthetic value and save space. The purpose of this research is to develop a steel rotary bending machine design for flower pot stand a
Externí odkaz:
https://doaj.org/article/8452bfae06494ff19ded266a6850137c
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 27-37 (2010)
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients. Formulas for
Autor:
Yuli Ye, Allan Borodin
Publikováno v:
Journal of Combinatorial Optimization. 16:198-228
Greedy algorithms are simple, but their relative power is not well understood. The priority framework (Borodin et al. in Algorithmica 37:295–326, 2003) captures a key notion of “greediness” in the sense that it processes (in some locally optima
The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93f57feb079599ed639550c55cf79982
Autor:
Janusz A. Brzozowski, Yuli Ye
Publikováno v:
International Journal of Foundations of Computer Science. 17:949-973
Transient simulation of a gate circuit is an efficient method of counting signal changes occurring during a transition of the circuit. It is known that this simulation covers the results of classical binary analysis, in the sense that all signal chan
Publikováno v:
JIF (Jurnal Ilmu Fisika), Vol 15, Iss 1 (2022)
A steel surface coating has been carried out using the immersion method in an inhibitor of cacao peel extract (Theobroma cacao) for 24, 72, 120, and 168 hours. The corrosion was treated using HCl with variations of immersion for 48, 96, and 144 hours
Externí odkaz:
https://doaj.org/article/23ec4f26830643f6a024939aa24146e9