Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Kang, Andy"'
Autor:
Chuin Liang Kang, Andy1 mathamh@usm.my, Miin Huey Ang1 AndyLiang715@gmail.com, Ahmad, Azhana1 azhana@usm.my, Zhen Chuan Ng1 zhenchuanng@usm.my
Publikováno v:
International Journal of Mathematics & Computer Science. 2021, Vol. 16 Issue 3, p857-869. 13p.
Autor:
Cao, Yanhong, Jiao, Yan, Wang, Lishi, Huang, Yue, Postlethwaite, Arnold, Stuart, John, Kang, Andy, Williams, Robert W., Gu, Weikuan
Publikováno v:
In International Immunopharmacology May 2012 13(1):28-36
Autor:
Kang, Andy N. C.
Publikováno v:
Proceedings of the May 16-18, 1972, Spring Joint Computer Conference; 5/16/1972, p493-501, 9p
Autor:
Kang, Andy N. C., Wang, Shih-Ho
A direct method based on a finite set of path formulas which describe the input-output relations of a given program can be used to verify programs containing no overlapping loops. One major difficulty in verifying programs with overlapping loops usin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::70f8b4977a0030d9bf0b4a4a44e47829
http://eprints.cs.vt.edu/archive/00000802/01/CS75022-R.pdf
http://eprints.cs.vt.edu/archive/00000802/01/CS75022-R.pdf
Autor:
Kang, Andy N. C.
The primary goal of this book is to introduce the basic concepts of effective computability and to prepare the reader for the study of formal language theory, recursive function theory, and the theory of computational complexity.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::b44153b5c2011e16da9e8ccd3d3e03b1
http://eprints.cs.vt.edu/archive/00000806/01/CS75030-R.pdf
http://eprints.cs.vt.edu/archive/00000806/01/CS75030-R.pdf
Autor:
Kang, Andy N. C., Kang, C. K.
In many combinatorial problems, the need to compute the number of unrestricted partitions of n or to enumerate over the set of unrestricted partitions of n occurs frequently. Let two positive integers k and n be given, the set of unordered k-tup1es (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::c81b6b522765ff7cfe4edceaeb8fa168
https://hdl.handle.net/10919/20211
https://hdl.handle.net/10919/20211
Autor:
Kang, Andy N. C., Shen, Stewart N.T.
In this paper, the definability of functions over B_s is first briefly discussed. We then give necessary and sufficient conditions on the definable functions over B_2, boolean algebra of four values. An efficient algorithm is also presented for findi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::2c617649e3bde7b2bfa9e2de95d46700
http://eprints.cs.vt.edu/archive/00000761/
http://eprints.cs.vt.edu/archive/00000761/
Autor:
Kang, Andy N. C., Ault, David A.
The notions of a balance node and the total path length with respect to a node u of a spanning tree are defined. We show that the total path length of a spanning tree with respect to u is minimal if and only if u is a balance node. An algorithm is al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::56e7569cec929cee4deeadf4ae335fe4
http://eprints.cs.vt.edu/archive/00000785/01/CS74032-R.pdf
http://eprints.cs.vt.edu/archive/00000785/01/CS74032-R.pdf
Autor:
Kang, Andy, Jung, Sung jin, Son, Daniel, Kim, Wook, Han, Young woo, Jung, Hwang soo, Lee, Bryan, Lee, Seung hoon, Lee, Yun seok
Publikováno v:
ACM SIGGRAPH ASIA 2010 Computer Animation Festival; 12/15/2010, p1-1, 1p
Autor:
Kang, Andy N.C., Ault, David A.
Publikováno v:
In Information Processing Letters 1975 4(1):18-20